/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-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:18:57,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:18:57,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-16 19:18:57,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:18:57,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:18:57,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:18:57,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:18:57,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:18:57,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:18:57,416 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:18:57,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:18:57,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:18:57,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:18:57,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:18:57,418 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:18:57,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:18:57,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:18:57,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:18:57,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:18:57,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:18:57,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:18:57,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:18:57,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:18:57,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:18:57,421 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:18:57,421 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:18:57,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:18:57,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:18:57,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:18:57,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:18:57,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:18:57,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:18:57,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:18:57,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:18:57,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:18:57,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:18:57,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:18:57,424 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:18:57,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:18:57,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:18:57,424 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-16 19:18:57,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:18:57,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:18:57,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:18:57,672 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:18:57,673 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:18:57,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2023-12-16 19:18:58,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:18:59,106 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:18:59,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2023-12-16 19:18:59,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08fa45d3e/e1d8a5a4d40f45c5aef9b2a4b05999f2/FLAG16315661c [2023-12-16 19:18:59,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08fa45d3e/e1d8a5a4d40f45c5aef9b2a4b05999f2 [2023-12-16 19:18:59,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:18:59,136 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:18:59,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:18:59,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:18:59,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:18:59,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:18:59,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9817ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59, skipping insertion in model container [2023-12-16 19:18:59,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:18:59,202 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:18:59,366 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c[1280,1293] [2023-12-16 19:18:59,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:18:59,615 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:18:59,623 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c[1280,1293] [2023-12-16 19:18:59,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:18:59,747 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:18:59,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59 WrapperNode [2023-12-16 19:18:59,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:18:59,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:18:59,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:18:59,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:18:59,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:18:59,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,000 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2185 [2023-12-16 19:19:00,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:19:00,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:19:00,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:19:00,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:19:00,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,095 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-16 19:19:00,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:19:00,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:19:00,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:19:00,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:19:00,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (1/1) ... [2023-12-16 19:19:00,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:19:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:19:00,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 19:19:00,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 19:19:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:19:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 19:19:00,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 19:19:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:19:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:19:00,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:19:00,552 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:19:00,553 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:19:02,126 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:19:02,191 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:19:02,193 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:19:02,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:02 BoogieIcfgContainer [2023-12-16 19:19:02,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:19:02,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:19:02,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:19:02,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:19:02,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:18:59" (1/3) ... [2023-12-16 19:19:02,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d61f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:02, skipping insertion in model container [2023-12-16 19:19:02,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:59" (2/3) ... [2023-12-16 19:19:02,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d61f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:02, skipping insertion in model container [2023-12-16 19:19:02,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:02" (3/3) ... [2023-12-16 19:19:02,201 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2023-12-16 19:19:02,217 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:19:02,217 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:19:02,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:19:02,290 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;@782c8bb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:19:02,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:19:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 417 states, 411 states have (on average 1.659367396593674) internal successors, (682), 412 states have internal predecessors, (682), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-16 19:19:02,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:02,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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-16 19:19:02,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:02,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2084022898, now seen corresponding path program 1 times [2023-12-16 19:19:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861866550] [2023-12-16 19:19:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:02,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:02,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861866550] [2023-12-16 19:19:02,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861866550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:02,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:02,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 19:19:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605770677] [2023-12-16 19:19:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:02,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 19:19:02,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:02,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 19:19:02,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 19:19:02,774 INFO L87 Difference]: Start difference. First operand has 417 states, 411 states have (on average 1.659367396593674) internal successors, (682), 412 states have internal predecessors, (682), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:02,850 INFO L93 Difference]: Finished difference Result 756 states and 1252 transitions. [2023-12-16 19:19:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 19:19:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 148 [2023-12-16 19:19:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:02,869 INFO L225 Difference]: With dead ends: 756 [2023-12-16 19:19:02,869 INFO L226 Difference]: Without dead ends: 415 [2023-12-16 19:19:02,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 19:19:02,879 INFO L413 NwaCegarLoop]: 682 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:02,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-16 19:19:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2023-12-16 19:19:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.6512195121951219) internal successors, (677), 410 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 683 transitions. [2023-12-16 19:19:02,944 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 683 transitions. Word has length 148 [2023-12-16 19:19:02,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:02,944 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 683 transitions. [2023-12-16 19:19:02,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 683 transitions. [2023-12-16 19:19:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-16 19:19:02,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:02,948 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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-16 19:19:02,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:19:02,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:02,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1512221496, now seen corresponding path program 1 times [2023-12-16 19:19:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:02,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491999894] [2023-12-16 19:19:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:03,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:03,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491999894] [2023-12-16 19:19:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491999894] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237672745] [2023-12-16 19:19:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:03,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:03,953 INFO L87 Difference]: Start difference. First operand 415 states and 683 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:04,003 INFO L93 Difference]: Finished difference Result 419 states and 687 transitions. [2023-12-16 19:19:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:04,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 148 [2023-12-16 19:19:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:04,007 INFO L225 Difference]: With dead ends: 419 [2023-12-16 19:19:04,007 INFO L226 Difference]: Without dead ends: 417 [2023-12-16 19:19:04,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:04,009 INFO L413 NwaCegarLoop]: 680 mSDtfsCounter, 1 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:04,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2035 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-16 19:19:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2023-12-16 19:19:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.6480582524271845) internal successors, (679), 412 states have internal predecessors, (679), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 685 transitions. [2023-12-16 19:19:04,038 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 685 transitions. Word has length 148 [2023-12-16 19:19:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:04,041 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 685 transitions. [2023-12-16 19:19:04,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 685 transitions. [2023-12-16 19:19:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-16 19:19:04,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:04,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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-16 19:19:04,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:19:04,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:04,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash 367499590, now seen corresponding path program 1 times [2023-12-16 19:19:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:04,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327968569] [2023-12-16 19:19:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:04,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:04,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:04,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327968569] [2023-12-16 19:19:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327968569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:04,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:04,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469609394] [2023-12-16 19:19:04,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:04,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:04,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:04,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:04,610 INFO L87 Difference]: Start difference. First operand 417 states and 685 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:05,012 INFO L93 Difference]: Finished difference Result 1056 states and 1726 transitions. [2023-12-16 19:19:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:05,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149 [2023-12-16 19:19:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:05,015 INFO L225 Difference]: With dead ends: 1056 [2023-12-16 19:19:05,015 INFO L226 Difference]: Without dead ends: 417 [2023-12-16 19:19:05,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:05,017 INFO L413 NwaCegarLoop]: 715 mSDtfsCounter, 1353 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:05,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 1963 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-16 19:19:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2023-12-16 19:19:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.645631067961165) internal successors, (678), 412 states have internal predecessors, (678), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 684 transitions. [2023-12-16 19:19:05,053 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 684 transitions. Word has length 149 [2023-12-16 19:19:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:05,053 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 684 transitions. [2023-12-16 19:19:05,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 684 transitions. [2023-12-16 19:19:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 19:19:05,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:05,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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-16 19:19:05,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:19:05,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:05,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash 719872988, now seen corresponding path program 1 times [2023-12-16 19:19:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:05,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765979496] [2023-12-16 19:19:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:05,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:05,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765979496] [2023-12-16 19:19:05,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765979496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:05,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:05,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006301227] [2023-12-16 19:19:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:05,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:05,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:05,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:05,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:05,510 INFO L87 Difference]: Start difference. First operand 417 states and 684 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:05,556 INFO L93 Difference]: Finished difference Result 761 states and 1246 transitions. [2023-12-16 19:19:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:05,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 150 [2023-12-16 19:19:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:05,559 INFO L225 Difference]: With dead ends: 761 [2023-12-16 19:19:05,559 INFO L226 Difference]: Without dead ends: 420 [2023-12-16 19:19:05,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:05,560 INFO L413 NwaCegarLoop]: 679 mSDtfsCounter, 1 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:05,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2030 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-12-16 19:19:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 419. [2023-12-16 19:19:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.642512077294686) internal successors, (680), 414 states have internal predecessors, (680), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 686 transitions. [2023-12-16 19:19:05,569 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 686 transitions. Word has length 150 [2023-12-16 19:19:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:05,570 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 686 transitions. [2023-12-16 19:19:05,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 686 transitions. [2023-12-16 19:19:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-16 19:19:05,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:05,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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-16 19:19:05,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:19:05,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:05,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 630794444, now seen corresponding path program 1 times [2023-12-16 19:19:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:05,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344737531] [2023-12-16 19:19:05,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:05,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:06,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:06,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344737531] [2023-12-16 19:19:06,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344737531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:06,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:06,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:06,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064353841] [2023-12-16 19:19:06,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:06,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:06,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:06,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:06,212 INFO L87 Difference]: Start difference. First operand 419 states and 686 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:06,355 INFO L93 Difference]: Finished difference Result 762 states and 1246 transitions. [2023-12-16 19:19:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:06,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 151 [2023-12-16 19:19:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:06,357 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:06,357 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:06,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:06,360 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 558 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:06,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1232 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6376811594202898) internal successors, (678), 414 states have internal predecessors, (678), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 684 transitions. [2023-12-16 19:19:06,374 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 684 transitions. Word has length 151 [2023-12-16 19:19:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:06,375 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 684 transitions. [2023-12-16 19:19:06,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 684 transitions. [2023-12-16 19:19:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-16 19:19:06,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:06,377 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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-16 19:19:06,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:19:06,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:06,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1200318974, now seen corresponding path program 1 times [2023-12-16 19:19:06,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813292033] [2023-12-16 19:19:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:06,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:06,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813292033] [2023-12-16 19:19:06,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813292033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:06,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:06,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90755928] [2023-12-16 19:19:06,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:06,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:06,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:06,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:06,757 INFO L87 Difference]: Start difference. First operand 419 states and 684 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:06,894 INFO L93 Difference]: Finished difference Result 770 states and 1253 transitions. [2023-12-16 19:19:06,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:06,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 152 [2023-12-16 19:19:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:06,897 INFO L225 Difference]: With dead ends: 770 [2023-12-16 19:19:06,897 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:06,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:06,898 INFO L413 NwaCegarLoop]: 670 mSDtfsCounter, 575 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:06,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1960 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:06,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6352657004830917) internal successors, (677), 414 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 683 transitions. [2023-12-16 19:19:06,908 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 683 transitions. Word has length 152 [2023-12-16 19:19:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:06,908 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 683 transitions. [2023-12-16 19:19:06,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 683 transitions. [2023-12-16 19:19:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-16 19:19:06,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:06,910 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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-16 19:19:06,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:19:06,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:06,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1243525774, now seen corresponding path program 1 times [2023-12-16 19:19:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:06,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504625832] [2023-12-16 19:19:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504625832] [2023-12-16 19:19:07,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504625832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:07,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:07,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:07,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923636410] [2023-12-16 19:19:07,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:07,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:07,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:07,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:07,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:07,292 INFO L87 Difference]: Start difference. First operand 419 states and 683 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:07,451 INFO L93 Difference]: Finished difference Result 762 states and 1240 transitions. [2023-12-16 19:19:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:07,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2023-12-16 19:19:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:07,454 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:07,455 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:07,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:07,458 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 1228 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:07,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1232 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6328502415458936) internal successors, (676), 414 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 682 transitions. [2023-12-16 19:19:07,472 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 682 transitions. Word has length 153 [2023-12-16 19:19:07,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:07,473 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 682 transitions. [2023-12-16 19:19:07,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 682 transitions. [2023-12-16 19:19:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-16 19:19:07,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:07,475 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1] [2023-12-16 19:19:07,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:19:07,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:07,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1999074332, now seen corresponding path program 1 times [2023-12-16 19:19:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:07,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532568886] [2023-12-16 19:19:07,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532568886] [2023-12-16 19:19:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532568886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:07,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:07,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017244837] [2023-12-16 19:19:07,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:07,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:07,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:07,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:07,881 INFO L87 Difference]: Start difference. First operand 419 states and 682 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:08,019 INFO L93 Difference]: Finished difference Result 762 states and 1238 transitions. [2023-12-16 19:19:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:08,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 154 [2023-12-16 19:19:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:08,025 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:08,026 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:08,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:08,028 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 1220 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:08,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 1232 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6304347826086956) internal successors, (675), 414 states have internal predecessors, (675), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 681 transitions. [2023-12-16 19:19:08,039 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 681 transitions. Word has length 154 [2023-12-16 19:19:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:08,039 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 681 transitions. [2023-12-16 19:19:08,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 681 transitions. [2023-12-16 19:19:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-16 19:19:08,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:08,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1] [2023-12-16 19:19:08,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:19:08,042 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:08,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:08,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1231327080, now seen corresponding path program 1 times [2023-12-16 19:19:08,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:08,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300863270] [2023-12-16 19:19:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300863270] [2023-12-16 19:19:08,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300863270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:08,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:08,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436168401] [2023-12-16 19:19:08,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:08,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:08,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:08,393 INFO L87 Difference]: Start difference. First operand 419 states and 681 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:08,532 INFO L93 Difference]: Finished difference Result 762 states and 1236 transitions. [2023-12-16 19:19:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:08,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 155 [2023-12-16 19:19:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:08,535 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:08,535 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:08,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:08,536 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 1212 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:08,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1232 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6280193236714975) internal successors, (674), 414 states have internal predecessors, (674), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 680 transitions. [2023-12-16 19:19:08,546 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 680 transitions. Word has length 155 [2023-12-16 19:19:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:08,547 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 680 transitions. [2023-12-16 19:19:08,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 680 transitions. [2023-12-16 19:19:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-16 19:19:08,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:08,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1] [2023-12-16 19:19:08,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:19:08,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:08,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:08,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1388087094, now seen corresponding path program 1 times [2023-12-16 19:19:08,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:08,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659887464] [2023-12-16 19:19:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:08,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:08,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659887464] [2023-12-16 19:19:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659887464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:08,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872735845] [2023-12-16 19:19:08,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:08,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:08,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:08,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:08,907 INFO L87 Difference]: Start difference. First operand 419 states and 680 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:09,142 INFO L93 Difference]: Finished difference Result 762 states and 1234 transitions. [2023-12-16 19:19:09,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:09,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 156 [2023-12-16 19:19:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:09,153 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:09,153 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:09,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:09,154 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 1198 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:09,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 1232 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6256038647342994) internal successors, (673), 414 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 679 transitions. [2023-12-16 19:19:09,182 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 679 transitions. Word has length 156 [2023-12-16 19:19:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:09,182 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 679 transitions. [2023-12-16 19:19:09,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 679 transitions. [2023-12-16 19:19:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-16 19:19:09,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:09,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1] [2023-12-16 19:19:09,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:19:09,186 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:09,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:09,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1181363932, now seen corresponding path program 1 times [2023-12-16 19:19:09,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:09,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348776853] [2023-12-16 19:19:09,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348776853] [2023-12-16 19:19:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348776853] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:09,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:09,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141719975] [2023-12-16 19:19:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:09,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:09,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:09,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:09,607 INFO L87 Difference]: Start difference. First operand 419 states and 679 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:09,741 INFO L93 Difference]: Finished difference Result 762 states and 1232 transitions. [2023-12-16 19:19:09,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:09,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 157 [2023-12-16 19:19:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:09,744 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:09,744 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:09,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:09,745 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 650 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:09,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1238 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6231884057971016) internal successors, (672), 414 states have internal predecessors, (672), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 678 transitions. [2023-12-16 19:19:09,755 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 678 transitions. Word has length 157 [2023-12-16 19:19:09,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:09,755 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 678 transitions. [2023-12-16 19:19:09,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 678 transitions. [2023-12-16 19:19:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-16 19:19:09,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:09,757 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2023-12-16 19:19:09,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:19:09,757 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:09,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1144499044, now seen corresponding path program 1 times [2023-12-16 19:19:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189320871] [2023-12-16 19:19:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:09,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:10,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:10,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189320871] [2023-12-16 19:19:10,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189320871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:10,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:10,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:10,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519460749] [2023-12-16 19:19:10,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:10,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:10,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:10,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:10,083 INFO L87 Difference]: Start difference. First operand 419 states and 678 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:10,217 INFO L93 Difference]: Finished difference Result 762 states and 1230 transitions. [2023-12-16 19:19:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:10,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 158 [2023-12-16 19:19:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:10,219 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:10,220 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:10,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:10,221 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 646 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:10,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1238 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6207729468599035) internal successors, (671), 414 states have internal predecessors, (671), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 677 transitions. [2023-12-16 19:19:10,232 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 677 transitions. Word has length 158 [2023-12-16 19:19:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:10,232 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 677 transitions. [2023-12-16 19:19:10,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 677 transitions. [2023-12-16 19:19:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-16 19:19:10,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:10,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:10,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:19:10,235 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:10,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash 262897334, now seen corresponding path program 1 times [2023-12-16 19:19:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:10,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212101170] [2023-12-16 19:19:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:10,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:10,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212101170] [2023-12-16 19:19:10,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212101170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:10,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:10,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508799846] [2023-12-16 19:19:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:10,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:10,695 INFO L87 Difference]: Start difference. First operand 419 states and 677 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:10,783 INFO L93 Difference]: Finished difference Result 762 states and 1228 transitions. [2023-12-16 19:19:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:10,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 159 [2023-12-16 19:19:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:10,785 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:10,785 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:10,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:10,787 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 567 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:10,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1278 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6183574879227054) internal successors, (670), 414 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 676 transitions. [2023-12-16 19:19:10,797 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 676 transitions. Word has length 159 [2023-12-16 19:19:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:10,798 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 676 transitions. [2023-12-16 19:19:10,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 676 transitions. [2023-12-16 19:19:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-16 19:19:10,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:10,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:10,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:19:10,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:10,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1754682790, now seen corresponding path program 1 times [2023-12-16 19:19:10,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:10,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995081391] [2023-12-16 19:19:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:11,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:11,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995081391] [2023-12-16 19:19:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995081391] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:11,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:11,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092372705] [2023-12-16 19:19:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:11,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:11,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:11,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:11,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:11,139 INFO L87 Difference]: Start difference. First operand 419 states and 676 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:11,227 INFO L93 Difference]: Finished difference Result 762 states and 1226 transitions. [2023-12-16 19:19:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:11,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 160 [2023-12-16 19:19:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:11,229 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:11,229 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:11,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:11,230 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 662 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:11,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1284 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6159420289855073) internal successors, (669), 414 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 675 transitions. [2023-12-16 19:19:11,243 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 675 transitions. Word has length 160 [2023-12-16 19:19:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:11,243 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 675 transitions. [2023-12-16 19:19:11,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 675 transitions. [2023-12-16 19:19:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-16 19:19:11,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:11,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:11,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:19:11,245 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:11,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2099398416, now seen corresponding path program 1 times [2023-12-16 19:19:11,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:11,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126806051] [2023-12-16 19:19:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:11,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:11,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126806051] [2023-12-16 19:19:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126806051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:11,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:11,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515641432] [2023-12-16 19:19:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:11,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:11,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:11,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:11,615 INFO L87 Difference]: Start difference. First operand 419 states and 675 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:11,702 INFO L93 Difference]: Finished difference Result 762 states and 1224 transitions. [2023-12-16 19:19:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:11,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 161 [2023-12-16 19:19:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:11,705 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:11,705 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:11,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:11,709 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 658 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:11,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1284 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6135265700483092) internal successors, (668), 414 states have internal predecessors, (668), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 674 transitions. [2023-12-16 19:19:11,720 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 674 transitions. Word has length 161 [2023-12-16 19:19:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:11,720 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 674 transitions. [2023-12-16 19:19:11,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 674 transitions. [2023-12-16 19:19:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-16 19:19:11,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:11,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:11,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:19:11,722 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:11,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash 340116340, now seen corresponding path program 1 times [2023-12-16 19:19:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216550825] [2023-12-16 19:19:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:12,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216550825] [2023-12-16 19:19:12,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216550825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:12,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:12,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:12,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008935900] [2023-12-16 19:19:12,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:12,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:12,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:12,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:12,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:12,065 INFO L87 Difference]: Start difference. First operand 419 states and 674 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:12,151 INFO L93 Difference]: Finished difference Result 762 states and 1222 transitions. [2023-12-16 19:19:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:12,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2023-12-16 19:19:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:12,153 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:12,153 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:12,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:12,154 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 654 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:12,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1284 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6111111111111112) internal successors, (667), 414 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 673 transitions. [2023-12-16 19:19:12,166 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 673 transitions. Word has length 162 [2023-12-16 19:19:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:12,167 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 673 transitions. [2023-12-16 19:19:12,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 673 transitions. [2023-12-16 19:19:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-16 19:19:12,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:12,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:12,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:19:12,169 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:12,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2020287594, now seen corresponding path program 1 times [2023-12-16 19:19:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:12,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131714252] [2023-12-16 19:19:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:12,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131714252] [2023-12-16 19:19:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131714252] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:12,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:12,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:12,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798196608] [2023-12-16 19:19:12,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:12,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:12,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:12,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:12,658 INFO L87 Difference]: Start difference. First operand 419 states and 673 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:12,715 INFO L93 Difference]: Finished difference Result 762 states and 1220 transitions. [2023-12-16 19:19:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:12,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 163 [2023-12-16 19:19:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:12,717 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:12,717 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:12,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:12,718 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 565 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:12,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1302 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.606280193236715) internal successors, (665), 414 states have internal predecessors, (665), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 671 transitions. [2023-12-16 19:19:12,732 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 671 transitions. Word has length 163 [2023-12-16 19:19:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:12,732 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 671 transitions. [2023-12-16 19:19:12,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 671 transitions. [2023-12-16 19:19:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-16 19:19:12,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:12,734 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:12,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 19:19:12,734 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:12,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1364610920, now seen corresponding path program 1 times [2023-12-16 19:19:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570450188] [2023-12-16 19:19:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570450188] [2023-12-16 19:19:13,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570450188] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:13,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:13,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738300995] [2023-12-16 19:19:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:13,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:13,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:13,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:13,108 INFO L87 Difference]: Start difference. First operand 419 states and 671 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:13,164 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2023-12-16 19:19:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:13,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 164 [2023-12-16 19:19:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:13,167 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:13,167 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:13,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:13,168 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 1216 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:13,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1302 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.603864734299517) internal successors, (664), 414 states have internal predecessors, (664), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 670 transitions. [2023-12-16 19:19:13,180 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 670 transitions. Word has length 164 [2023-12-16 19:19:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:13,180 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 670 transitions. [2023-12-16 19:19:13,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 670 transitions. [2023-12-16 19:19:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-16 19:19:13,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:13,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:13,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 19:19:13,183 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:13,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1954525370, now seen corresponding path program 1 times [2023-12-16 19:19:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:13,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823324617] [2023-12-16 19:19:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:13,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:19:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:19:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:13,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823324617] [2023-12-16 19:19:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823324617] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:13,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:13,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455373667] [2023-12-16 19:19:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:13,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:13,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:13,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:13,737 INFO L87 Difference]: Start difference. First operand 419 states and 670 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:13,792 INFO L93 Difference]: Finished difference Result 762 states and 1214 transitions. [2023-12-16 19:19:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:13,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 165 [2023-12-16 19:19:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:13,795 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:13,795 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:13,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:13,796 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 601 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:13,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1306 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6014492753623188) internal successors, (663), 414 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 669 transitions. [2023-12-16 19:19:13,810 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 669 transitions. Word has length 165 [2023-12-16 19:19:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:13,810 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 669 transitions. [2023-12-16 19:19:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 669 transitions. [2023-12-16 19:19:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-16 19:19:13,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:13,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:13,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 19:19:13,812 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:13,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1715172212, now seen corresponding path program 1 times [2023-12-16 19:19:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177110618] [2023-12-16 19:19:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:14,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:14,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177110618] [2023-12-16 19:19:14,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177110618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:14,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:14,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:14,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963713302] [2023-12-16 19:19:14,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:14,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:14,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:14,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:14,310 INFO L87 Difference]: Start difference. First operand 419 states and 669 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:14,361 INFO L93 Difference]: Finished difference Result 762 states and 1212 transitions. [2023-12-16 19:19:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:14,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 166 [2023-12-16 19:19:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:14,364 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:19:14,364 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:19:14,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:14,365 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 598 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:14,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1306 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:19:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:19:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.5990338164251208) internal successors, (662), 414 states have internal predecessors, (662), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 668 transitions. [2023-12-16 19:19:14,377 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 668 transitions. Word has length 166 [2023-12-16 19:19:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:14,377 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 668 transitions. [2023-12-16 19:19:14,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 668 transitions. [2023-12-16 19:19:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-16 19:19:14,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:14,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:14,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 19:19:14,379 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:14,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1272652686, now seen corresponding path program 1 times [2023-12-16 19:19:14,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:14,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859618929] [2023-12-16 19:19:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:15,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:15,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859618929] [2023-12-16 19:19:15,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859618929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:15,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:15,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:15,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899282326] [2023-12-16 19:19:15,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:15,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:15,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:15,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:15,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:15,112 INFO L87 Difference]: Start difference. First operand 419 states and 668 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:15,322 INFO L93 Difference]: Finished difference Result 768 states and 1218 transitions. [2023-12-16 19:19:15,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 166 [2023-12-16 19:19:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:15,324 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:15,324 INFO L226 Difference]: Without dead ends: 423 [2023-12-16 19:19:15,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:15,326 INFO L413 NwaCegarLoop]: 658 mSDtfsCounter, 4 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:15,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2480 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-16 19:19:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2023-12-16 19:19:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5961538461538463) internal successors, (664), 416 states have internal predecessors, (664), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 670 transitions. [2023-12-16 19:19:15,339 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 670 transitions. Word has length 166 [2023-12-16 19:19:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:15,339 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 670 transitions. [2023-12-16 19:19:15,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 670 transitions. [2023-12-16 19:19:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:15,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:15,342 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:15,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 19:19:15,342 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:15,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2065717842, now seen corresponding path program 1 times [2023-12-16 19:19:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:15,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301314863] [2023-12-16 19:19:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:16,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:16,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301314863] [2023-12-16 19:19:16,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301314863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:16,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:16,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328474515] [2023-12-16 19:19:16,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:16,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:16,275 INFO L87 Difference]: Start difference. First operand 421 states and 670 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:16,610 INFO L93 Difference]: Finished difference Result 768 states and 1217 transitions. [2023-12-16 19:19:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:19:16,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:16,614 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:16,614 INFO L226 Difference]: Without dead ends: 423 [2023-12-16 19:19:16,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:16,616 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 566 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:16,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1528 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-16 19:19:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 422. [2023-12-16 19:19:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5947242206235013) internal successors, (665), 417 states have internal predecessors, (665), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 671 transitions. [2023-12-16 19:19:16,630 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 671 transitions. Word has length 167 [2023-12-16 19:19:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:16,631 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 671 transitions. [2023-12-16 19:19:16,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 671 transitions. [2023-12-16 19:19:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:16,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:16,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:16,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 19:19:16,633 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:16,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:16,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1505018064, now seen corresponding path program 1 times [2023-12-16 19:19:16,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:16,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201084872] [2023-12-16 19:19:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:16,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201084872] [2023-12-16 19:19:17,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201084872] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:17,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:17,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:17,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569756098] [2023-12-16 19:19:17,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:17,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:17,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:17,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:17,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:17,066 INFO L87 Difference]: Start difference. First operand 422 states and 671 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:17,151 INFO L93 Difference]: Finished difference Result 768 states and 1216 transitions. [2023-12-16 19:19:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:17,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:17,155 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:17,155 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:19:17,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:17,156 INFO L413 NwaCegarLoop]: 633 mSDtfsCounter, 552 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:17,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1268 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:19:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:19:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.592326139088729) internal successors, (664), 417 states have internal predecessors, (664), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 670 transitions. [2023-12-16 19:19:17,169 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 670 transitions. Word has length 167 [2023-12-16 19:19:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:17,171 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 670 transitions. [2023-12-16 19:19:17,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 670 transitions. [2023-12-16 19:19:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:17,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:17,173 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:17,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 19:19:17,173 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:17,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1858106446, now seen corresponding path program 1 times [2023-12-16 19:19:17,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:17,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545551418] [2023-12-16 19:19:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:17,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:17,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:17,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545551418] [2023-12-16 19:19:17,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545551418] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:17,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:17,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:17,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790845644] [2023-12-16 19:19:17,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:17,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:17,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:17,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:17,675 INFO L87 Difference]: Start difference. First operand 422 states and 670 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:17,773 INFO L93 Difference]: Finished difference Result 768 states and 1214 transitions. [2023-12-16 19:19:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:17,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:17,775 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:17,775 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:19:17,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:17,777 INFO L413 NwaCegarLoop]: 633 mSDtfsCounter, 1097 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:17,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1268 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:19:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:19:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.589928057553957) internal successors, (663), 417 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 669 transitions. [2023-12-16 19:19:17,791 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 669 transitions. Word has length 167 [2023-12-16 19:19:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:17,791 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 669 transitions. [2023-12-16 19:19:17,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 669 transitions. [2023-12-16 19:19:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:17,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:17,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:17,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 19:19:17,793 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:17,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:17,794 INFO L85 PathProgramCache]: Analyzing trace with hash 387473008, now seen corresponding path program 1 times [2023-12-16 19:19:17,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:17,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747998196] [2023-12-16 19:19:17,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:17,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:18,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:18,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747998196] [2023-12-16 19:19:18,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747998196] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:18,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:18,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908089824] [2023-12-16 19:19:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:18,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:18,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:18,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:18,264 INFO L87 Difference]: Start difference. First operand 422 states and 669 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:18,359 INFO L93 Difference]: Finished difference Result 768 states and 1212 transitions. [2023-12-16 19:19:18,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:18,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:18,361 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:18,361 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:19:18,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:18,362 INFO L413 NwaCegarLoop]: 633 mSDtfsCounter, 549 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:18,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1274 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:19:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:19:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5875299760191846) internal successors, (662), 417 states have internal predecessors, (662), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 668 transitions. [2023-12-16 19:19:18,386 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 668 transitions. Word has length 167 [2023-12-16 19:19:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:18,386 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 668 transitions. [2023-12-16 19:19:18,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 668 transitions. [2023-12-16 19:19:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:18,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:18,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:18,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 19:19:18,389 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:18,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash 811119730, now seen corresponding path program 1 times [2023-12-16 19:19:18,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:18,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418271885] [2023-12-16 19:19:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418271885] [2023-12-16 19:19:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418271885] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:18,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:18,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057864940] [2023-12-16 19:19:18,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:18,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:18,792 INFO L87 Difference]: Start difference. First operand 422 states and 668 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:18,950 INFO L93 Difference]: Finished difference Result 768 states and 1210 transitions. [2023-12-16 19:19:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:18,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:18,953 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:18,953 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:19:18,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:18,954 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 537 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:18,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1208 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:19:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:19:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5851318944844124) internal successors, (661), 417 states have internal predecessors, (661), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 667 transitions. [2023-12-16 19:19:18,972 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 667 transitions. Word has length 167 [2023-12-16 19:19:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:18,972 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 667 transitions. [2023-12-16 19:19:18,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 667 transitions. [2023-12-16 19:19:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:18,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:18,975 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:18,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 19:19:18,975 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:18,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -32885772, now seen corresponding path program 1 times [2023-12-16 19:19:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356379497] [2023-12-16 19:19:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:19,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356379497] [2023-12-16 19:19:19,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356379497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:19,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:19,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:19,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118759132] [2023-12-16 19:19:19,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:19,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:19,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:19,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:19,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:19,588 INFO L87 Difference]: Start difference. First operand 422 states and 667 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:19,728 INFO L93 Difference]: Finished difference Result 768 states and 1208 transitions. [2023-12-16 19:19:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:19,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:19,730 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:19,730 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:19:19,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:19,732 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 1067 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:19,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 1208 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:19:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:19:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5827338129496402) internal successors, (660), 417 states have internal predecessors, (660), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 666 transitions. [2023-12-16 19:19:19,745 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 666 transitions. Word has length 167 [2023-12-16 19:19:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:19,745 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 666 transitions. [2023-12-16 19:19:19,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 666 transitions. [2023-12-16 19:19:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:19,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:19,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:19,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 19:19:19,747 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:19,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash 241873842, now seen corresponding path program 1 times [2023-12-16 19:19:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382646264] [2023-12-16 19:19:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:20,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:20,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382646264] [2023-12-16 19:19:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382646264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045324325] [2023-12-16 19:19:20,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:20,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:20,285 INFO L87 Difference]: Start difference. First operand 422 states and 666 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:20,421 INFO L93 Difference]: Finished difference Result 768 states and 1206 transitions. [2023-12-16 19:19:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:20,424 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:20,424 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:19:20,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:20,426 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 534 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:20,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1214 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:19:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:19:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.580335731414868) internal successors, (659), 417 states have internal predecessors, (659), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 665 transitions. [2023-12-16 19:19:20,439 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 665 transitions. Word has length 167 [2023-12-16 19:19:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:20,439 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 665 transitions. [2023-12-16 19:19:20,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 665 transitions. [2023-12-16 19:19:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:20,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:20,441 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:20,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 19:19:20,441 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:20,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1628077236, now seen corresponding path program 1 times [2023-12-16 19:19:20,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:20,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084727920] [2023-12-16 19:19:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:20,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:20,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084727920] [2023-12-16 19:19:20,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084727920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:20,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:20,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:20,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608843307] [2023-12-16 19:19:20,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:20,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:20,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:20,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:20,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:20,925 INFO L87 Difference]: Start difference. First operand 422 states and 665 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:21,067 INFO L93 Difference]: Finished difference Result 768 states and 1204 transitions. [2023-12-16 19:19:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:21,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:21,072 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:21,072 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:19:21,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:21,073 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 533 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:21,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1214 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:19:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:19:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5779376498800959) internal successors, (658), 417 states have internal predecessors, (658), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 664 transitions. [2023-12-16 19:19:21,088 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 664 transitions. Word has length 167 [2023-12-16 19:19:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:21,089 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 664 transitions. [2023-12-16 19:19:21,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 664 transitions. [2023-12-16 19:19:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:21,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:21,090 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:21,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 19:19:21,091 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:21,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1690116850, now seen corresponding path program 1 times [2023-12-16 19:19:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:21,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793892904] [2023-12-16 19:19:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:21,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:21,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:21,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793892904] [2023-12-16 19:19:21,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793892904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:21,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:21,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702359452] [2023-12-16 19:19:21,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:21,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:21,642 INFO L87 Difference]: Start difference. First operand 422 states and 664 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:21,780 INFO L93 Difference]: Finished difference Result 768 states and 1202 transitions. [2023-12-16 19:19:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:21,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:21,783 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:21,783 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:19:21,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:21,785 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 532 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:21,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1214 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:19:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:19:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5755395683453237) internal successors, (657), 417 states have internal predecessors, (657), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 663 transitions. [2023-12-16 19:19:21,813 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 663 transitions. Word has length 167 [2023-12-16 19:19:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:21,814 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 663 transitions. [2023-12-16 19:19:21,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 663 transitions. [2023-12-16 19:19:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:21,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:21,816 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:21,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 19:19:21,817 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:21,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 872468400, now seen corresponding path program 1 times [2023-12-16 19:19:21,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:21,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147490737] [2023-12-16 19:19:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:22,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147490737] [2023-12-16 19:19:22,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147490737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:22,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:22,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616566078] [2023-12-16 19:19:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:22,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:22,370 INFO L87 Difference]: Start difference. First operand 422 states and 663 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:22,505 INFO L93 Difference]: Finished difference Result 768 states and 1200 transitions. [2023-12-16 19:19:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:22,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:22,507 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:19:22,508 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:19:22,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:22,509 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 531 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:22,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1214 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:19:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:19:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5731414868105515) internal successors, (656), 417 states have internal predecessors, (656), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 662 transitions. [2023-12-16 19:19:22,523 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 662 transitions. Word has length 167 [2023-12-16 19:19:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:22,523 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 662 transitions. [2023-12-16 19:19:22,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 662 transitions. [2023-12-16 19:19:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:19:22,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:22,525 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:22,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 19:19:22,525 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:22,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash -715879502, now seen corresponding path program 1 times [2023-12-16 19:19:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:22,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660279216] [2023-12-16 19:19:22,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:22,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:23,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:23,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660279216] [2023-12-16 19:19:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660279216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:23,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:23,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639491108] [2023-12-16 19:19:23,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:23,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:23,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:23,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:23,444 INFO L87 Difference]: Start difference. First operand 422 states and 662 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:23,541 INFO L93 Difference]: Finished difference Result 1226 states and 1867 transitions. [2023-12-16 19:19:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:19:23,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:19:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:23,544 INFO L225 Difference]: With dead ends: 1226 [2023-12-16 19:19:23,545 INFO L226 Difference]: Without dead ends: 880 [2023-12-16 19:19:23,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:23,547 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 1049 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:23,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 3701 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2023-12-16 19:19:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 481. [2023-12-16 19:19:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.523109243697479) internal successors, (725), 476 states have internal predecessors, (725), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 731 transitions. [2023-12-16 19:19:23,568 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 731 transitions. Word has length 167 [2023-12-16 19:19:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:23,569 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 731 transitions. [2023-12-16 19:19:23,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 731 transitions. [2023-12-16 19:19:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-16 19:19:23,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:23,571 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:23,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 19:19:23,571 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:23,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1952736930, now seen corresponding path program 1 times [2023-12-16 19:19:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:23,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885052688] [2023-12-16 19:19:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885052688] [2023-12-16 19:19:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885052688] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:19:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235114562] [2023-12-16 19:19:23,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:23,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:23,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:23,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:23,995 INFO L87 Difference]: Start difference. First operand 481 states and 731 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:24,079 INFO L93 Difference]: Finished difference Result 1253 states and 1908 transitions. [2023-12-16 19:19:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:19:24,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 168 [2023-12-16 19:19:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:24,083 INFO L225 Difference]: With dead ends: 1253 [2023-12-16 19:19:24,083 INFO L226 Difference]: Without dead ends: 848 [2023-12-16 19:19:24,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:24,085 INFO L413 NwaCegarLoop]: 737 mSDtfsCounter, 1578 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:24,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 2793 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2023-12-16 19:19:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 495. [2023-12-16 19:19:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.5244897959183674) internal successors, (747), 490 states have internal predecessors, (747), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 753 transitions. [2023-12-16 19:19:24,105 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 753 transitions. Word has length 168 [2023-12-16 19:19:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:24,105 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 753 transitions. [2023-12-16 19:19:24,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 753 transitions. [2023-12-16 19:19:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-16 19:19:24,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:24,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-16 19:19:24,107 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:24,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash 882479452, now seen corresponding path program 1 times [2023-12-16 19:19:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:24,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824634675] [2023-12-16 19:19:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:19:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:24,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824634675] [2023-12-16 19:19:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824634675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:24,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:24,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:19:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219796773] [2023-12-16 19:19:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:24,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:19:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:24,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:19:24,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:24,625 INFO L87 Difference]: Start difference. First operand 495 states and 753 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:24,992 INFO L93 Difference]: Finished difference Result 998 states and 1507 transitions. [2023-12-16 19:19:24,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:19:24,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 168 [2023-12-16 19:19:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:24,995 INFO L225 Difference]: With dead ends: 998 [2023-12-16 19:19:24,995 INFO L226 Difference]: Without dead ends: 528 [2023-12-16 19:19:24,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:19:24,996 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 1131 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:24,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 2835 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-16 19:19:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 497. [2023-12-16 19:19:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 492 states have (on average 1.5203252032520325) internal successors, (748), 492 states have internal predecessors, (748), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 754 transitions. [2023-12-16 19:19:25,014 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 754 transitions. Word has length 168 [2023-12-16 19:19:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:25,014 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 754 transitions. [2023-12-16 19:19:25,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 754 transitions. [2023-12-16 19:19:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-16 19:19:25,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:25,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:25,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-16 19:19:25,016 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:25,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:25,017 INFO L85 PathProgramCache]: Analyzing trace with hash 421562158, now seen corresponding path program 1 times [2023-12-16 19:19:25,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:25,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484651332] [2023-12-16 19:19:25,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:25,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 19:19:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:26,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:26,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484651332] [2023-12-16 19:19:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484651332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:26,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:26,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 19:19:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624321250] [2023-12-16 19:19:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:26,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 19:19:26,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:26,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 19:19:26,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:19:26,068 INFO L87 Difference]: Start difference. First operand 497 states and 754 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:27,528 INFO L93 Difference]: Finished difference Result 1752 states and 2625 transitions. [2023-12-16 19:19:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 19:19:27,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 169 [2023-12-16 19:19:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:27,533 INFO L225 Difference]: With dead ends: 1752 [2023-12-16 19:19:27,533 INFO L226 Difference]: Without dead ends: 1331 [2023-12-16 19:19:27,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:19:27,535 INFO L413 NwaCegarLoop]: 1454 mSDtfsCounter, 2025 mSDsluCounter, 4541 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 5995 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:27,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 5995 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 19:19:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2023-12-16 19:19:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 549. [2023-12-16 19:19:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 542 states have (on average 1.5202952029520296) internal successors, (824), 542 states have internal predecessors, (824), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:19:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 834 transitions. [2023-12-16 19:19:27,572 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 834 transitions. Word has length 169 [2023-12-16 19:19:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:27,572 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 834 transitions. [2023-12-16 19:19:27,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 834 transitions. [2023-12-16 19:19:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-16 19:19:27,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:27,575 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:27,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-16 19:19:27,575 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:27,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1658108216, now seen corresponding path program 1 times [2023-12-16 19:19:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708505392] [2023-12-16 19:19:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:19:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 19:19:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:28,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:28,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708505392] [2023-12-16 19:19:28,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708505392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:28,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:19:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307566000] [2023-12-16 19:19:28,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:28,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:19:28,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:28,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:19:28,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:28,468 INFO L87 Difference]: Start difference. First operand 549 states and 834 transitions. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:29,066 INFO L93 Difference]: Finished difference Result 1602 states and 2411 transitions. [2023-12-16 19:19:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 19:19:29,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 169 [2023-12-16 19:19:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:29,070 INFO L225 Difference]: With dead ends: 1602 [2023-12-16 19:19:29,070 INFO L226 Difference]: Without dead ends: 1039 [2023-12-16 19:19:29,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-12-16 19:19:29,072 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 1153 mSDsluCounter, 5134 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 6281 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:29,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 6281 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:19:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2023-12-16 19:19:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 554. [2023-12-16 19:19:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 547 states have (on average 1.5191956124314443) internal successors, (831), 547 states have internal predecessors, (831), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:19:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 841 transitions. [2023-12-16 19:19:29,101 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 841 transitions. Word has length 169 [2023-12-16 19:19:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:29,101 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 841 transitions. [2023-12-16 19:19:29,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 841 transitions. [2023-12-16 19:19:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-16 19:19:29,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:29,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:29,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-16 19:19:29,103 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:29,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1993945952, now seen corresponding path program 1 times [2023-12-16 19:19:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39217344] [2023-12-16 19:19:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:29,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 19:19:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 19:19:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:29,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39217344] [2023-12-16 19:19:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39217344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:29,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:29,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:19:29,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389722331] [2023-12-16 19:19:29,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:29,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:29,631 INFO L87 Difference]: Start difference. First operand 554 states and 841 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:30,087 INFO L93 Difference]: Finished difference Result 1055 states and 1590 transitions. [2023-12-16 19:19:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:30,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 170 [2023-12-16 19:19:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:30,090 INFO L225 Difference]: With dead ends: 1055 [2023-12-16 19:19:30,090 INFO L226 Difference]: Without dead ends: 577 [2023-12-16 19:19:30,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:19:30,091 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 1107 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:30,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1650 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:19:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2023-12-16 19:19:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 552. [2023-12-16 19:19:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 545 states have (on average 1.5155963302752293) internal successors, (826), 545 states have internal predecessors, (826), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:19:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 836 transitions. [2023-12-16 19:19:30,116 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 836 transitions. Word has length 170 [2023-12-16 19:19:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:30,116 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 836 transitions. [2023-12-16 19:19:30,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 836 transitions. [2023-12-16 19:19:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-16 19:19:30,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:30,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:30,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-16 19:19:30,118 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:30,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 87542686, now seen corresponding path program 1 times [2023-12-16 19:19:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:30,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444296187] [2023-12-16 19:19:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:19:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 19:19:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 19:19:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:30,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:30,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444296187] [2023-12-16 19:19:30,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444296187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:30,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:30,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:19:30,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111802007] [2023-12-16 19:19:30,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:30,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:19:30,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:30,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:19:30,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:30,795 INFO L87 Difference]: Start difference. First operand 552 states and 836 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:31,168 INFO L93 Difference]: Finished difference Result 1141 states and 1712 transitions. [2023-12-16 19:19:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:19:31,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 170 [2023-12-16 19:19:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:31,171 INFO L225 Difference]: With dead ends: 1141 [2023-12-16 19:19:31,171 INFO L226 Difference]: Without dead ends: 560 [2023-12-16 19:19:31,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:19:31,172 INFO L413 NwaCegarLoop]: 635 mSDtfsCounter, 1308 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:31,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 2534 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-12-16 19:19:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 554. [2023-12-16 19:19:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 547 states have (on average 1.5118829981718465) internal successors, (827), 547 states have internal predecessors, (827), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:19:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 837 transitions. [2023-12-16 19:19:31,195 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 837 transitions. Word has length 170 [2023-12-16 19:19:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:31,196 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 837 transitions. [2023-12-16 19:19:31,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 837 transitions. [2023-12-16 19:19:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-16 19:19:31,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:31,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:31,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-16 19:19:31,197 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:31,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:31,198 INFO L85 PathProgramCache]: Analyzing trace with hash -784466536, now seen corresponding path program 1 times [2023-12-16 19:19:31,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:31,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750169068] [2023-12-16 19:19:31,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:31,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750169068] [2023-12-16 19:19:31,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750169068] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:31,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:31,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:19:31,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838486075] [2023-12-16 19:19:31,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:31,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:31,805 INFO L87 Difference]: Start difference. First operand 554 states and 837 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:32,247 INFO L93 Difference]: Finished difference Result 1038 states and 1557 transitions. [2023-12-16 19:19:32,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:32,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2023-12-16 19:19:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:32,250 INFO L225 Difference]: With dead ends: 1038 [2023-12-16 19:19:32,250 INFO L226 Difference]: Without dead ends: 560 [2023-12-16 19:19:32,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:19:32,252 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 1115 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:32,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1585 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:19:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-12-16 19:19:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 555. [2023-12-16 19:19:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 548 states have (on average 1.510948905109489) internal successors, (828), 548 states have internal predecessors, (828), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:19:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 838 transitions. [2023-12-16 19:19:32,278 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 838 transitions. Word has length 171 [2023-12-16 19:19:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:32,278 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 838 transitions. [2023-12-16 19:19:32,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 838 transitions. [2023-12-16 19:19:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-16 19:19:32,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:32,280 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:32,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-16 19:19:32,280 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:32,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1217419734, now seen corresponding path program 1 times [2023-12-16 19:19:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:32,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490205789] [2023-12-16 19:19:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:32,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490205789] [2023-12-16 19:19:33,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490205789] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:33,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:33,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 19:19:33,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217170782] [2023-12-16 19:19:33,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:33,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 19:19:33,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:33,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 19:19:33,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:19:33,951 INFO L87 Difference]: Start difference. First operand 555 states and 838 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:34,693 INFO L93 Difference]: Finished difference Result 2508 states and 3753 transitions. [2023-12-16 19:19:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 19:19:34,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 171 [2023-12-16 19:19:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:34,700 INFO L225 Difference]: With dead ends: 2508 [2023-12-16 19:19:34,700 INFO L226 Difference]: Without dead ends: 2029 [2023-12-16 19:19:34,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-12-16 19:19:34,703 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 5563 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5566 SdHoareTripleChecker+Valid, 6203 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:34,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5566 Valid, 6203 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 19:19:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2023-12-16 19:19:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 654. [2023-12-16 19:19:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 642 states have (on average 1.4953271028037383) internal successors, (960), 642 states have internal predecessors, (960), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:19:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 980 transitions. [2023-12-16 19:19:34,759 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 980 transitions. Word has length 171 [2023-12-16 19:19:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:34,760 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 980 transitions. [2023-12-16 19:19:34,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 980 transitions. [2023-12-16 19:19:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-16 19:19:34,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:34,762 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:19:34,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-16 19:19:34,762 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:34,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2107589756, now seen corresponding path program 1 times [2023-12-16 19:19:34,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:34,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628794779] [2023-12-16 19:19:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:34,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628794779] [2023-12-16 19:19:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628794779] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:35,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:35,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:19:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636207865] [2023-12-16 19:19:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:35,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:35,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:35,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:35,611 INFO L87 Difference]: Start difference. First operand 654 states and 980 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:35,808 INFO L93 Difference]: Finished difference Result 1851 states and 2731 transitions. [2023-12-16 19:19:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:19:35,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2023-12-16 19:19:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:35,814 INFO L225 Difference]: With dead ends: 1851 [2023-12-16 19:19:35,815 INFO L226 Difference]: Without dead ends: 1372 [2023-12-16 19:19:35,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:19:35,817 INFO L413 NwaCegarLoop]: 793 mSDtfsCounter, 2684 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:35,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2687 Valid, 2722 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2023-12-16 19:19:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 906. [2023-12-16 19:19:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 889 states have (on average 1.453318335208099) internal successors, (1292), 889 states have internal predecessors, (1292), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 19:19:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1322 transitions. [2023-12-16 19:19:35,884 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1322 transitions. Word has length 171 [2023-12-16 19:19:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:35,884 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1322 transitions. [2023-12-16 19:19:35,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1322 transitions. [2023-12-16 19:19:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2023-12-16 19:19:35,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:35,889 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 1] [2023-12-16 19:19:35,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-16 19:19:35,889 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:35,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash 599177152, now seen corresponding path program 1 times [2023-12-16 19:19:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:35,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985260133] [2023-12-16 19:19:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-12-16 19:19:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2023-12-16 19:19:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2023-12-16 19:19:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:36,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985260133] [2023-12-16 19:19:36,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985260133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:36,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:36,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:36,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659415011] [2023-12-16 19:19:36,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:36,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:36,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:36,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:36,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:36,695 INFO L87 Difference]: Start difference. First operand 906 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:36,848 INFO L93 Difference]: Finished difference Result 1385 states and 2034 transitions. [2023-12-16 19:19:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:36,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 429 [2023-12-16 19:19:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:36,864 INFO L225 Difference]: With dead ends: 1385 [2023-12-16 19:19:36,865 INFO L226 Difference]: Without dead ends: 906 [2023-12-16 19:19:36,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:36,866 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1071 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:36,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1202 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2023-12-16 19:19:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2023-12-16 19:19:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 889 states have (on average 1.452193475815523) internal successors, (1291), 889 states have internal predecessors, (1291), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 19:19:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1321 transitions. [2023-12-16 19:19:36,928 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1321 transitions. Word has length 429 [2023-12-16 19:19:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:36,929 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1321 transitions. [2023-12-16 19:19:36,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1321 transitions. [2023-12-16 19:19:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2023-12-16 19:19:36,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:36,935 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 1, 1] [2023-12-16 19:19:36,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-16 19:19:36,935 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:36,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1905611616, now seen corresponding path program 1 times [2023-12-16 19:19:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:36,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268904568] [2023-12-16 19:19:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-12-16 19:19:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2023-12-16 19:19:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-12-16 19:19:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:37,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268904568] [2023-12-16 19:19:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268904568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:37,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:37,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:37,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592095017] [2023-12-16 19:19:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:37,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:37,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:37,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:37,743 INFO L87 Difference]: Start difference. First operand 906 states and 1321 transitions. Second operand has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:37,892 INFO L93 Difference]: Finished difference Result 1385 states and 2032 transitions. [2023-12-16 19:19:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:37,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 430 [2023-12-16 19:19:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:37,897 INFO L225 Difference]: With dead ends: 1385 [2023-12-16 19:19:37,897 INFO L226 Difference]: Without dead ends: 906 [2023-12-16 19:19:37,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:37,906 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1055 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:37,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1202 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2023-12-16 19:19:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2023-12-16 19:19:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 889 states have (on average 1.4510686164229472) internal successors, (1290), 889 states have internal predecessors, (1290), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 19:19:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1320 transitions. [2023-12-16 19:19:37,969 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1320 transitions. Word has length 430 [2023-12-16 19:19:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:37,970 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1320 transitions. [2023-12-16 19:19:37,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1320 transitions. [2023-12-16 19:19:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2023-12-16 19:19:37,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:37,974 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 1, 1, 1] [2023-12-16 19:19:37,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-16 19:19:37,975 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:37,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash 14581004, now seen corresponding path program 1 times [2023-12-16 19:19:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248199370] [2023-12-16 19:19:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:37,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2023-12-16 19:19:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-12-16 19:19:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:19:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:38,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:38,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248199370] [2023-12-16 19:19:38,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248199370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:38,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:38,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182677932] [2023-12-16 19:19:38,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:38,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:38,830 INFO L87 Difference]: Start difference. First operand 906 states and 1320 transitions. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:38,986 INFO L93 Difference]: Finished difference Result 1385 states and 2030 transitions. [2023-12-16 19:19:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 431 [2023-12-16 19:19:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:38,990 INFO L225 Difference]: With dead ends: 1385 [2023-12-16 19:19:38,991 INFO L226 Difference]: Without dead ends: 906 [2023-12-16 19:19:38,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:38,993 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1039 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:38,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1202 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2023-12-16 19:19:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2023-12-16 19:19:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 889 states have (on average 1.4499437570303713) internal successors, (1289), 889 states have internal predecessors, (1289), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 19:19:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1319 transitions. [2023-12-16 19:19:39,054 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1319 transitions. Word has length 431 [2023-12-16 19:19:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:39,055 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1319 transitions. [2023-12-16 19:19:39,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1319 transitions. [2023-12-16 19:19:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2023-12-16 19:19:39,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:39,059 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 1, 1, 1, 1] [2023-12-16 19:19:39,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-16 19:19:39,060 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:39,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash -474827472, now seen corresponding path program 1 times [2023-12-16 19:19:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:39,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079992075] [2023-12-16 19:19:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-12-16 19:19:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-12-16 19:19:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2023-12-16 19:19:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079992075] [2023-12-16 19:19:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079992075] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:40,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:40,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800266511] [2023-12-16 19:19:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:40,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:40,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:40,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:40,036 INFO L87 Difference]: Start difference. First operand 906 states and 1319 transitions. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:40,205 INFO L93 Difference]: Finished difference Result 1385 states and 2028 transitions. [2023-12-16 19:19:40,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:40,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 432 [2023-12-16 19:19:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:40,209 INFO L225 Difference]: With dead ends: 1385 [2023-12-16 19:19:40,209 INFO L226 Difference]: Without dead ends: 906 [2023-12-16 19:19:40,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:40,212 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1023 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:40,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1202 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2023-12-16 19:19:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2023-12-16 19:19:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 889 states have (on average 1.4488188976377954) internal successors, (1288), 889 states have internal predecessors, (1288), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 19:19:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1318 transitions. [2023-12-16 19:19:40,295 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1318 transitions. Word has length 432 [2023-12-16 19:19:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:40,295 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1318 transitions. [2023-12-16 19:19:40,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1318 transitions. [2023-12-16 19:19:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2023-12-16 19:19:40,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:40,301 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2023-12-16 19:19:40,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-16 19:19:40,301 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:40,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -851393510, now seen corresponding path program 1 times [2023-12-16 19:19:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399718094] [2023-12-16 19:19:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:40,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-16 19:19:40,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-16 19:19:40,588 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.colorLiterals(Interpolator.java:798) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:236) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-16 19:19:40,592 INFO L158 Benchmark]: Toolchain (without parser) took 41456.47ms. Allocated memory was 187.7MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 128.6MB in the beginning and 770.1MB in the end (delta: -641.5MB). Peak memory consumption was 282.0MB. Max. memory is 8.0GB. [2023-12-16 19:19:40,592 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:19:40,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.50ms. Allocated memory was 187.7MB in the beginning and 262.1MB in the end (delta: 74.4MB). Free memory was 128.3MB in the beginning and 215.8MB in the end (delta: -87.5MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. [2023-12-16 19:19:40,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 235.35ms. Allocated memory is still 262.1MB. Free memory was 215.8MB in the beginning and 174.4MB in the end (delta: 41.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-12-16 19:19:40,592 INFO L158 Benchmark]: Boogie Preprocessor took 239.87ms. Allocated memory is still 262.1MB. Free memory was 174.4MB in the beginning and 151.8MB in the end (delta: 22.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-16 19:19:40,592 INFO L158 Benchmark]: RCFGBuilder took 1951.00ms. Allocated memory is still 262.1MB. Free memory was 151.8MB in the beginning and 144.7MB in the end (delta: 7.2MB). Peak memory consumption was 119.5MB. Max. memory is 8.0GB. [2023-12-16 19:19:40,593 INFO L158 Benchmark]: TraceAbstraction took 38396.21ms. Allocated memory was 262.1MB in the beginning and 1.1GB in the end (delta: 848.3MB). Free memory was 144.1MB in the beginning and 770.1MB in the end (delta: -626.0MB). Peak memory consumption was 222.9MB. Max. memory is 8.0GB. [2023-12-16 19:19:40,594 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 625.50ms. Allocated memory was 187.7MB in the beginning and 262.1MB in the end (delta: 74.4MB). Free memory was 128.3MB in the beginning and 215.8MB in the end (delta: -87.5MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 235.35ms. Allocated memory is still 262.1MB. Free memory was 215.8MB in the beginning and 174.4MB in the end (delta: 41.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 239.87ms. Allocated memory is still 262.1MB. Free memory was 174.4MB in the beginning and 151.8MB in the end (delta: 22.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1951.00ms. Allocated memory is still 262.1MB. Free memory was 151.8MB in the beginning and 144.7MB in the end (delta: 7.2MB). Peak memory consumption was 119.5MB. Max. memory is 8.0GB. * TraceAbstraction took 38396.21ms. Allocated memory was 262.1MB in the beginning and 1.1GB in the end (delta: 848.3MB). Free memory was 144.1MB in the beginning and 770.1MB in the end (delta: -626.0MB). Peak memory consumption was 222.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.colorLiterals(Interpolator.java:798) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown