/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_w64_d8_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 17:22:57,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 17:22:57,614 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-25 17:22:57,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 17:22:57,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 17:22:57,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 17:22:57,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 17:22:57,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 17:22:57,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 17:22:57,650 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 17:22:57,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 17:22:57,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 17:22:57,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 17:22:57,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 17:22:57,652 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 17:22:57,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 17:22:57,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 17:22:57,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-25 17:22:57,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 17:22:57,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 17:22:57,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 17:22:57,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 17:22:57,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 17:22:57,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 17:22:57,654 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 17:22:57,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 17:22:57,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 17:22:57,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 17:22:57,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 17:22:57,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 17:22:57,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 17:22:57,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 17:22:57,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 17:22:57,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-25 17:22:57,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-25 17:22:57,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 17:22:57,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 17:22:57,657 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 17:22:57,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 17:22:57,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 17:22:57,657 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-25 17:22:57,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 17:22:57,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 17:22:57,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 17:22:57,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 17:22:57,856 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 17:22:57,856 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_w64_d8_e0.c [2023-12-25 17:22:58,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 17:22:58,998 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 17:22:58,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2023-12-25 17:22:59,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f005c0f6/db5a20e3465341068258412598aba7b9/FLAG79c28516f [2023-12-25 17:22:59,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f005c0f6/db5a20e3465341068258412598aba7b9 [2023-12-25 17:22:59,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 17:22:59,026 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 17:22:59,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 17:22:59,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 17:22:59,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 17:22:59,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43334da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59, skipping insertion in model container [2023-12-25 17:22:59,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,068 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 17:22:59,191 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_w64_d8_e0.c[1279,1292] [2023-12-25 17:22:59,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 17:22:59,372 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 17:22:59,381 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_w64_d8_e0.c[1279,1292] [2023-12-25 17:22:59,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 17:22:59,473 INFO L206 MainTranslator]: Completed translation [2023-12-25 17:22:59,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59 WrapperNode [2023-12-25 17:22:59,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 17:22:59,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 17:22:59,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 17:22:59,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 17:22:59,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,647 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1535 [2023-12-25 17:22:59,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 17:22:59,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 17:22:59,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 17:22:59,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 17:22:59,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,712 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-25 17:22:59,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 17:22:59,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 17:22:59,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 17:22:59,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 17:22:59,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (1/1) ... [2023-12-25 17:22:59,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 17:22:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:22:59,833 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-25 17:22:59,841 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-25 17:22:59,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 17:22:59,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 17:22:59,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 17:22:59,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-25 17:22:59,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 17:22:59,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 17:23:00,021 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 17:23:00,022 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 17:23:00,995 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 17:23:01,037 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 17:23:01,038 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 17:23:01,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:23:01 BoogieIcfgContainer [2023-12-25 17:23:01,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 17:23:01,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 17:23:01,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 17:23:01,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 17:23:01,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:22:59" (1/3) ... [2023-12-25 17:23:01,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e021101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:23:01, skipping insertion in model container [2023-12-25 17:23:01,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:22:59" (2/3) ... [2023-12-25 17:23:01,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e021101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:23:01, skipping insertion in model container [2023-12-25 17:23:01,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:23:01" (3/3) ... [2023-12-25 17:23:01,044 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2023-12-25 17:23:01,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 17:23:01,056 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 17:23:01,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 17:23:01,107 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;@1e758e73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 17:23:01,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 17:23:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 297 states, 291 states have (on average 1.6563573883161513) internal successors, (482), 292 states have internal predecessors, (482), 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-25 17:23:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-25 17:23:01,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:01,137 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] [2023-12-25 17:23:01,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:01,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1078998386, now seen corresponding path program 1 times [2023-12-25 17:23:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703902059] [2023-12-25 17:23:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-25 17:23:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-25 17:23:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:01,493 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-25 17:23:01,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:01,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703902059] [2023-12-25 17:23:01,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703902059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:01,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:01,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 17:23:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52211376] [2023-12-25 17:23:01,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:01,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 17:23:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 17:23:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 17:23:01,531 INFO L87 Difference]: Start difference. First operand has 297 states, 291 states have (on average 1.6563573883161513) internal successors, (482), 292 states have internal predecessors, (482), 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 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-25 17:23:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:01,583 INFO L93 Difference]: Finished difference Result 540 states and 892 transitions. [2023-12-25 17:23:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 17:23:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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 116 [2023-12-25 17:23:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:01,599 INFO L225 Difference]: With dead ends: 540 [2023-12-25 17:23:01,599 INFO L226 Difference]: Without dead ends: 295 [2023-12-25 17:23:01,604 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-25 17:23:01,607 INFO L413 NwaCegarLoop]: 482 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, 482 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-25 17:23:01,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-12-25 17:23:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-12-25 17:23:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 290 states have (on average 1.6448275862068966) internal successors, (477), 290 states have internal predecessors, (477), 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-25 17:23:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 483 transitions. [2023-12-25 17:23:01,663 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 483 transitions. Word has length 116 [2023-12-25 17:23:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:01,663 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 483 transitions. [2023-12-25 17:23:01,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-25 17:23:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 483 transitions. [2023-12-25 17:23:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-25 17:23:01,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:01,669 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] [2023-12-25 17:23:01,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-25 17:23:01,670 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:01,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1359904200, now seen corresponding path program 1 times [2023-12-25 17:23:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:01,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403703128] [2023-12-25 17:23:01,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:01,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:02,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-25 17:23:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-25 17:23:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:02,283 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-25 17:23:02,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:02,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403703128] [2023-12-25 17:23:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403703128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:02,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:02,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:02,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035890891] [2023-12-25 17:23:02,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:02,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:02,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:02,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:02,289 INFO L87 Difference]: Start difference. First operand 295 states and 483 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-25 17:23:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:02,324 INFO L93 Difference]: Finished difference Result 299 states and 487 transitions. [2023-12-25 17:23:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:02,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 116 [2023-12-25 17:23:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:02,327 INFO L225 Difference]: With dead ends: 299 [2023-12-25 17:23:02,327 INFO L226 Difference]: Without dead ends: 297 [2023-12-25 17:23:02,328 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-25 17:23:02,329 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 1 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1435 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-25 17:23:02,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1435 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-25 17:23:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-12-25 17:23:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 292 states have (on average 1.6404109589041096) internal successors, (479), 292 states have internal predecessors, (479), 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-25 17:23:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 485 transitions. [2023-12-25 17:23:02,341 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 485 transitions. Word has length 116 [2023-12-25 17:23:02,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:02,343 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 485 transitions. [2023-12-25 17:23:02,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-25 17:23:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 485 transitions. [2023-12-25 17:23:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-25 17:23:02,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:02,345 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] [2023-12-25 17:23:02,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-25 17:23:02,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:02,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:02,346 INFO L85 PathProgramCache]: Analyzing trace with hash -790917242, now seen corresponding path program 1 times [2023-12-25 17:23:02,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:02,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603632414] [2023-12-25 17:23:02,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:02,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:02,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-25 17:23:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:02,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-25 17:23:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:02,676 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-25 17:23:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603632414] [2023-12-25 17:23:02,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603632414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:02,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:02,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820149654] [2023-12-25 17:23:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:02,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:02,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:02,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:02,684 INFO L87 Difference]: Start difference. First operand 297 states and 485 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-25 17:23:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:02,960 INFO L93 Difference]: Finished difference Result 752 states and 1222 transitions. [2023-12-25 17:23:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 17:23:02,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 117 [2023-12-25 17:23:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:02,963 INFO L225 Difference]: With dead ends: 752 [2023-12-25 17:23:02,963 INFO L226 Difference]: Without dead ends: 297 [2023-12-25 17:23:02,966 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-25 17:23:02,968 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 913 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:02,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1411 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 17:23:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-25 17:23:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-12-25 17:23:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 292 states have (on average 1.6369863013698631) internal successors, (478), 292 states have internal predecessors, (478), 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-25 17:23:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 484 transitions. [2023-12-25 17:23:02,974 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 484 transitions. Word has length 117 [2023-12-25 17:23:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:02,974 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 484 transitions. [2023-12-25 17:23:02,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-25 17:23:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 484 transitions. [2023-12-25 17:23:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-25 17:23:02,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:02,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] [2023-12-25 17:23:02,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-25 17:23:02,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:02,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash 986526220, now seen corresponding path program 1 times [2023-12-25 17:23:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886960419] [2023-12-25 17:23:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-25 17:23:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-25 17:23:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,313 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-25 17:23:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:03,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886960419] [2023-12-25 17:23:03,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886960419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:03,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:03,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:03,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655984081] [2023-12-25 17:23:03,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:03,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:03,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:03,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:03,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:03,315 INFO L87 Difference]: Start difference. First operand 297 states and 484 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-25 17:23:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:03,339 INFO L93 Difference]: Finished difference Result 545 states and 886 transitions. [2023-12-25 17:23:03,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:03,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 118 [2023-12-25 17:23:03,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:03,341 INFO L225 Difference]: With dead ends: 545 [2023-12-25 17:23:03,341 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 17:23:03,341 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-25 17:23:03,346 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 1 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1430 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-25 17:23:03,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1430 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 17:23:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2023-12-25 17:23:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6326530612244898) internal successors, (480), 294 states have internal predecessors, (480), 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-25 17:23:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 486 transitions. [2023-12-25 17:23:03,352 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 486 transitions. Word has length 118 [2023-12-25 17:23:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:03,353 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 486 transitions. [2023-12-25 17:23:03,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-25 17:23:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 486 transitions. [2023-12-25 17:23:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-25 17:23:03,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:03,354 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] [2023-12-25 17:23:03,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-25 17:23:03,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:03,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:03,354 INFO L85 PathProgramCache]: Analyzing trace with hash 307109852, now seen corresponding path program 1 times [2023-12-25 17:23:03,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:03,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592358123] [2023-12-25 17:23:03,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:03,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-25 17:23:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-25 17:23:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,675 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-25 17:23:03,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:03,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592358123] [2023-12-25 17:23:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592358123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:03,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476096407] [2023-12-25 17:23:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:03,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:03,676 INFO L87 Difference]: Start difference. First operand 299 states and 486 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-25 17:23:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:03,720 INFO L93 Difference]: Finished difference Result 546 states and 886 transitions. [2023-12-25 17:23:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:03,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 119 [2023-12-25 17:23:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:03,721 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:03,721 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:03,722 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-25 17:23:03,722 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 396 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:03,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 928 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.629251700680272) internal successors, (479), 294 states have internal predecessors, (479), 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-25 17:23:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 485 transitions. [2023-12-25 17:23:03,727 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 485 transitions. Word has length 119 [2023-12-25 17:23:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:03,728 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 485 transitions. [2023-12-25 17:23:03,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-25 17:23:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 485 transitions. [2023-12-25 17:23:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-25 17:23:03,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:03,729 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] [2023-12-25 17:23:03,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-25 17:23:03,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:03,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash -602034372, now seen corresponding path program 1 times [2023-12-25 17:23:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:03,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127861497] [2023-12-25 17:23:03,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:03,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-25 17:23:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-25 17:23:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:03,957 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-25 17:23:03,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:03,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127861497] [2023-12-25 17:23:03,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127861497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:03,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:03,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645910156] [2023-12-25 17:23:03,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:03,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:03,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:03,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:03,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:03,959 INFO L87 Difference]: Start difference. First operand 299 states and 485 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-25 17:23:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:04,026 INFO L93 Difference]: Finished difference Result 546 states and 884 transitions. [2023-12-25 17:23:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:04,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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 120 [2023-12-25 17:23:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:04,028 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:04,028 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:04,028 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-25 17:23:04,029 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 471 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:04,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 934 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6258503401360545) internal successors, (478), 294 states have internal predecessors, (478), 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-25 17:23:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 484 transitions. [2023-12-25 17:23:04,035 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 484 transitions. Word has length 120 [2023-12-25 17:23:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:04,035 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 484 transitions. [2023-12-25 17:23:04,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-25 17:23:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 484 transitions. [2023-12-25 17:23:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-25 17:23:04,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:04,036 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] [2023-12-25 17:23:04,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-25 17:23:04,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:04,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1199198390, now seen corresponding path program 1 times [2023-12-25 17:23:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110603244] [2023-12-25 17:23:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:04,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-25 17:23:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-25 17:23:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:04,370 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-25 17:23:04,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:04,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110603244] [2023-12-25 17:23:04,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110603244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:04,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:04,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:04,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402851511] [2023-12-25 17:23:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:04,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:04,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:04,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:04,372 INFO L87 Difference]: Start difference. First operand 299 states and 484 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-25 17:23:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:04,416 INFO L93 Difference]: Finished difference Result 546 states and 882 transitions. [2023-12-25 17:23:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:04,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 121 [2023-12-25 17:23:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:04,418 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:04,418 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:04,419 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-25 17:23:04,419 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 431 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 934 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-25 17:23:04,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 934 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6224489795918366) internal successors, (477), 294 states have internal predecessors, (477), 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-25 17:23:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 483 transitions. [2023-12-25 17:23:04,428 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 483 transitions. Word has length 121 [2023-12-25 17:23:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:04,429 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 483 transitions. [2023-12-25 17:23:04,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-25 17:23:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 483 transitions. [2023-12-25 17:23:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-25 17:23:04,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:04,430 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] [2023-12-25 17:23:04,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-25 17:23:04,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:04,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:04,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785428, now seen corresponding path program 1 times [2023-12-25 17:23:04,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:04,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393986297] [2023-12-25 17:23:04,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:04,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:04,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:04,728 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-25 17:23:04,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:04,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393986297] [2023-12-25 17:23:04,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393986297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:04,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887161705] [2023-12-25 17:23:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:04,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:04,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:04,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:04,730 INFO L87 Difference]: Start difference. First operand 299 states and 483 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-25 17:23:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:04,798 INFO L93 Difference]: Finished difference Result 546 states and 880 transitions. [2023-12-25 17:23:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:04,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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 122 [2023-12-25 17:23:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:04,800 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:04,801 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:04,802 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-25 17:23:04,803 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 386 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 890 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.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:04,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 890 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.619047619047619) internal successors, (476), 294 states have internal predecessors, (476), 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-25 17:23:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 482 transitions. [2023-12-25 17:23:04,809 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 482 transitions. Word has length 122 [2023-12-25 17:23:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:04,809 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 482 transitions. [2023-12-25 17:23:04,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-25 17:23:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 482 transitions. [2023-12-25 17:23:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-25 17:23:04,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:04,810 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] [2023-12-25 17:23:04,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-25 17:23:04,811 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:04,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1462564768, now seen corresponding path program 1 times [2023-12-25 17:23:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:04,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817767829] [2023-12-25 17:23:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,020 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-25 17:23:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:05,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817767829] [2023-12-25 17:23:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817767829] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:05,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:05,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577071994] [2023-12-25 17:23:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:05,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:05,022 INFO L87 Difference]: Start difference. First operand 299 states and 482 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-25 17:23:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:05,103 INFO L93 Difference]: Finished difference Result 546 states and 878 transitions. [2023-12-25 17:23:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 123 [2023-12-25 17:23:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:05,104 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:05,104 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:05,105 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-25 17:23:05,105 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 847 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 890 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-25 17:23:05,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 890 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:23:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6156462585034013) internal successors, (475), 294 states have internal predecessors, (475), 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-25 17:23:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 481 transitions. [2023-12-25 17:23:05,111 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 481 transitions. Word has length 123 [2023-12-25 17:23:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:05,111 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 481 transitions. [2023-12-25 17:23:05,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-25 17:23:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 481 transitions. [2023-12-25 17:23:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-25 17:23:05,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:05,112 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] [2023-12-25 17:23:05,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-25 17:23:05,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:05,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:05,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1127444154, now seen corresponding path program 1 times [2023-12-25 17:23:05,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:05,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832485302] [2023-12-25 17:23:05,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,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-25 17:23:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832485302] [2023-12-25 17:23:05,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832485302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:05,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:05,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:05,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101656930] [2023-12-25 17:23:05,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:05,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:05,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:05,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:05,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:05,310 INFO L87 Difference]: Start difference. First operand 299 states and 481 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-25 17:23:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:05,372 INFO L93 Difference]: Finished difference Result 546 states and 876 transitions. [2023-12-25 17:23:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:05,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 124 [2023-12-25 17:23:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:05,374 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:05,374 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:05,374 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-25 17:23:05,375 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 464 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 896 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.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:05,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 896 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6122448979591837) internal successors, (474), 294 states have internal predecessors, (474), 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-25 17:23:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 480 transitions. [2023-12-25 17:23:05,381 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 480 transitions. Word has length 124 [2023-12-25 17:23:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:05,382 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 480 transitions. [2023-12-25 17:23:05,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-25 17:23:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 480 transitions. [2023-12-25 17:23:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-25 17:23:05,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:05,383 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] [2023-12-25 17:23:05,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-25 17:23:05,383 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:05,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1709075078, now seen corresponding path program 1 times [2023-12-25 17:23:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:05,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539580678] [2023-12-25 17:23:05,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:05,596 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-25 17:23:05,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:05,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539580678] [2023-12-25 17:23:05,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539580678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:05,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:05,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224139595] [2023-12-25 17:23:05,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:05,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:05,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:05,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:05,599 INFO L87 Difference]: Start difference. First operand 299 states and 480 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-25 17:23:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:05,666 INFO L93 Difference]: Finished difference Result 546 states and 874 transitions. [2023-12-25 17:23:05,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:05,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 125 [2023-12-25 17:23:05,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:05,668 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:05,668 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:05,668 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-25 17:23:05,668 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 831 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 890 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.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:05,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 890 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6088435374149659) internal successors, (473), 294 states have internal predecessors, (473), 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-25 17:23:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 479 transitions. [2023-12-25 17:23:05,675 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 479 transitions. Word has length 125 [2023-12-25 17:23:05,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:05,675 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 479 transitions. [2023-12-25 17:23:05,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-25 17:23:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 479 transitions. [2023-12-25 17:23:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-25 17:23:05,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:05,676 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] [2023-12-25 17:23:05,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-25 17:23:05,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:05,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:05,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1996412576, now seen corresponding path program 1 times [2023-12-25 17:23:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577246702] [2023-12-25 17:23:05,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,080 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-25 17:23:06,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:06,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577246702] [2023-12-25 17:23:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577246702] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:06,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908922794] [2023-12-25 17:23:06,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:06,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:06,082 INFO L87 Difference]: Start difference. First operand 299 states and 479 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-25 17:23:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:06,160 INFO L93 Difference]: Finished difference Result 546 states and 872 transitions. [2023-12-25 17:23:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 126 [2023-12-25 17:23:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:06,161 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:06,161 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:06,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 17:23:06,162 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 381 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:06,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1330 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:23:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6054421768707483) internal successors, (472), 294 states have internal predecessors, (472), 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-25 17:23:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 478 transitions. [2023-12-25 17:23:06,168 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 478 transitions. Word has length 126 [2023-12-25 17:23:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:06,169 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 478 transitions. [2023-12-25 17:23:06,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-25 17:23:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 478 transitions. [2023-12-25 17:23:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-25 17:23:06,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:06,170 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] [2023-12-25 17:23:06,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-25 17:23:06,170 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:06,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash 190974242, now seen corresponding path program 1 times [2023-12-25 17:23:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:06,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73130422] [2023-12-25 17:23:06,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:06,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,554 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-25 17:23:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73130422] [2023-12-25 17:23:06,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73130422] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:06,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:06,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306890256] [2023-12-25 17:23:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:06,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:06,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:06,556 INFO L87 Difference]: Start difference. First operand 299 states and 478 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-25 17:23:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:06,630 INFO L93 Difference]: Finished difference Result 546 states and 870 transitions. [2023-12-25 17:23:06,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:06,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 126 [2023-12-25 17:23:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:06,632 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:06,632 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:06,633 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-25 17:23:06,633 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 378 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 896 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.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:06,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 896 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6020408163265305) internal successors, (471), 294 states have internal predecessors, (471), 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-25 17:23:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 477 transitions. [2023-12-25 17:23:06,641 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 477 transitions. Word has length 126 [2023-12-25 17:23:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:06,641 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 477 transitions. [2023-12-25 17:23:06,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-25 17:23:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 477 transitions. [2023-12-25 17:23:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-25 17:23:06,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:06,642 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] [2023-12-25 17:23:06,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-25 17:23:06,643 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:06,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash -626674208, now seen corresponding path program 1 times [2023-12-25 17:23:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833426822] [2023-12-25 17:23:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,003 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-25 17:23:07,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:07,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833426822] [2023-12-25 17:23:07,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833426822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:07,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111643281] [2023-12-25 17:23:07,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:07,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:07,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:07,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:07,005 INFO L87 Difference]: Start difference. First operand 299 states and 477 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-25 17:23:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:07,074 INFO L93 Difference]: Finished difference Result 546 states and 868 transitions. [2023-12-25 17:23:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 126 [2023-12-25 17:23:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:07,076 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:07,076 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:07,076 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-25 17:23:07,077 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 748 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 890 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.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:07,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 890 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.598639455782313) internal successors, (470), 294 states have internal predecessors, (470), 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-25 17:23:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 476 transitions. [2023-12-25 17:23:07,084 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 476 transitions. Word has length 126 [2023-12-25 17:23:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:07,084 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 476 transitions. [2023-12-25 17:23:07,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-25 17:23:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 476 transitions. [2023-12-25 17:23:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-25 17:23:07,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:07,085 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] [2023-12-25 17:23:07,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-25 17:23:07,086 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:07,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2079945186, now seen corresponding path program 1 times [2023-12-25 17:23:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358153698] [2023-12-25 17:23:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,320 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-25 17:23:07,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:07,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358153698] [2023-12-25 17:23:07,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358153698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:07,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:07,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:07,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786657473] [2023-12-25 17:23:07,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:07,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:07,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:07,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:07,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:07,322 INFO L87 Difference]: Start difference. First operand 299 states and 476 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-25 17:23:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:07,365 INFO L93 Difference]: Finished difference Result 546 states and 866 transitions. [2023-12-25 17:23:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:07,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 126 [2023-12-25 17:23:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:07,366 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:07,366 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:07,368 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-25 17:23:07,368 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 421 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 920 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-25 17:23:07,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 920 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5952380952380953) internal successors, (469), 294 states have internal predecessors, (469), 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-25 17:23:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 475 transitions. [2023-12-25 17:23:07,375 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 475 transitions. Word has length 126 [2023-12-25 17:23:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:07,375 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 475 transitions. [2023-12-25 17:23:07,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-25 17:23:07,375 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 475 transitions. [2023-12-25 17:23:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-25 17:23:07,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:07,376 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] [2023-12-25 17:23:07,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-25 17:23:07,376 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:07,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2107010788, now seen corresponding path program 1 times [2023-12-25 17:23:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:07,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057092820] [2023-12-25 17:23:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:07,703 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-25 17:23:07,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:07,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057092820] [2023-12-25 17:23:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057092820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:07,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:07,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475771545] [2023-12-25 17:23:07,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:07,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:07,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:07,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:07,706 INFO L87 Difference]: Start difference. First operand 299 states and 475 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-25 17:23:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:07,748 INFO L93 Difference]: Finished difference Result 546 states and 864 transitions. [2023-12-25 17:23:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:07,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 126 [2023-12-25 17:23:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:07,750 INFO L225 Difference]: With dead ends: 546 [2023-12-25 17:23:07,750 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:07,750 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-25 17:23:07,751 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 382 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:07,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 910 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5918367346938775) internal successors, (468), 294 states have internal predecessors, (468), 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-25 17:23:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 474 transitions. [2023-12-25 17:23:07,760 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 474 transitions. Word has length 126 [2023-12-25 17:23:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:07,760 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 474 transitions. [2023-12-25 17:23:07,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-25 17:23:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 474 transitions. [2023-12-25 17:23:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-25 17:23:07,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:07,761 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] [2023-12-25 17:23:07,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-25 17:23:07,761 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:07,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:07,762 INFO L85 PathProgramCache]: Analyzing trace with hash -801753114, now seen corresponding path program 1 times [2023-12-25 17:23:07,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:07,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540386391] [2023-12-25 17:23:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:07,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:08,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:08,104 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-25 17:23:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:08,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540386391] [2023-12-25 17:23:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540386391] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223654262] [2023-12-25 17:23:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:08,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:08,106 INFO L87 Difference]: Start difference. First operand 299 states and 474 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-25 17:23:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:08,243 INFO L93 Difference]: Finished difference Result 548 states and 864 transitions. [2023-12-25 17:23:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 17:23:08,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 126 [2023-12-25 17:23:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:08,245 INFO L225 Difference]: With dead ends: 548 [2023-12-25 17:23:08,245 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 17:23:08,246 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-25 17:23:08,246 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 4 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:08,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1277 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:23:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 17:23:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-25 17:23:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.58843537414966) internal successors, (467), 294 states have internal predecessors, (467), 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-25 17:23:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 473 transitions. [2023-12-25 17:23:08,256 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 473 transitions. Word has length 126 [2023-12-25 17:23:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:08,256 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 473 transitions. [2023-12-25 17:23:08,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-25 17:23:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 473 transitions. [2023-12-25 17:23:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-25 17:23:08,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:08,257 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] [2023-12-25 17:23:08,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-25 17:23:08,257 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:08,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash -186832874, now seen corresponding path program 1 times [2023-12-25 17:23:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800430402] [2023-12-25 17:23:08,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:08,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:08,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:08,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:08,907 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-25 17:23:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800430402] [2023-12-25 17:23:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800430402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:08,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 17:23:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606048799] [2023-12-25 17:23:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:08,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 17:23:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 17:23:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 17:23:08,909 INFO L87 Difference]: Start difference. First operand 299 states and 473 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-25 17:23:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:09,028 INFO L93 Difference]: Finished difference Result 872 states and 1369 transitions. [2023-12-25 17:23:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 17:23:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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 127 [2023-12-25 17:23:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:09,030 INFO L225 Difference]: With dead ends: 872 [2023-12-25 17:23:09,030 INFO L226 Difference]: Without dead ends: 625 [2023-12-25 17:23:09,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-25 17:23:09,031 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 1950 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 1967 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-25 17:23:09,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 1967 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:23:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-25 17:23:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2023-12-25 17:23:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5613577023498695) internal successors, (598), 383 states have internal predecessors, (598), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 610 transitions. [2023-12-25 17:23:09,044 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 610 transitions. Word has length 127 [2023-12-25 17:23:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:09,044 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 610 transitions. [2023-12-25 17:23:09,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-25 17:23:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 610 transitions. [2023-12-25 17:23:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-12-25 17:23:09,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:09,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:09,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-25 17:23:09,047 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:09,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1486298518, now seen corresponding path program 1 times [2023-12-25 17:23:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:09,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067329226] [2023-12-25 17:23:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:09,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-12-25 17:23:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-25 17:23:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-25 17:23:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:09,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:09,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067329226] [2023-12-25 17:23:09,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067329226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:09,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:09,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:09,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511710360] [2023-12-25 17:23:09,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:09,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:09,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:09,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:09,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:09,652 INFO L87 Difference]: Start difference. First operand 391 states and 610 transitions. Second operand has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 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-25 17:23:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:09,720 INFO L93 Difference]: Finished difference Result 638 states and 997 transitions. [2023-12-25 17:23:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:09,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 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 309 [2023-12-25 17:23:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:09,722 INFO L225 Difference]: With dead ends: 638 [2023-12-25 17:23:09,722 INFO L226 Difference]: Without dead ends: 391 [2023-12-25 17:23:09,722 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-25 17:23:09,723 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 426 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:09,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 890 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-25 17:23:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-25 17:23:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.558746736292428) internal successors, (597), 383 states have internal predecessors, (597), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 609 transitions. [2023-12-25 17:23:09,736 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 609 transitions. Word has length 309 [2023-12-25 17:23:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:09,736 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 609 transitions. [2023-12-25 17:23:09,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 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-25 17:23:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 609 transitions. [2023-12-25 17:23:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2023-12-25 17:23:09,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:09,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:09,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-25 17:23:09,740 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:09,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:09,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1863575638, now seen corresponding path program 1 times [2023-12-25 17:23:09,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:09,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891224319] [2023-12-25 17:23:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:09,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-25 17:23:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-25 17:23:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-25 17:23:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:10,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891224319] [2023-12-25 17:23:10,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891224319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:10,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169608925] [2023-12-25 17:23:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:10,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:10,339 INFO L87 Difference]: Start difference. First operand 391 states and 609 transitions. Second operand has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 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-25 17:23:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:10,399 INFO L93 Difference]: Finished difference Result 638 states and 995 transitions. [2023-12-25 17:23:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 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 310 [2023-12-25 17:23:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:10,402 INFO L225 Difference]: With dead ends: 638 [2023-12-25 17:23:10,402 INFO L226 Difference]: Without dead ends: 391 [2023-12-25 17:23:10,404 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-25 17:23:10,404 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 418 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:10,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 890 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-25 17:23:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-25 17:23:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.556135770234987) internal successors, (596), 383 states have internal predecessors, (596), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 608 transitions. [2023-12-25 17:23:10,420 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 608 transitions. Word has length 310 [2023-12-25 17:23:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:10,420 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 608 transitions. [2023-12-25 17:23:10,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 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-25 17:23:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 608 transitions. [2023-12-25 17:23:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-12-25 17:23:10,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:10,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:10,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-25 17:23:10,423 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:10,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash 372564790, now seen corresponding path program 1 times [2023-12-25 17:23:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:10,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365377462] [2023-12-25 17:23:10,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:10,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-12-25 17:23:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-25 17:23:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-25 17:23:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:10,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365377462] [2023-12-25 17:23:10,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365377462] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:10,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:10,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261638618] [2023-12-25 17:23:10,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:10,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:10,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:10,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:10,998 INFO L87 Difference]: Start difference. First operand 391 states and 608 transitions. Second operand has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 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-25 17:23:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:11,061 INFO L93 Difference]: Finished difference Result 638 states and 993 transitions. [2023-12-25 17:23:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 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 311 [2023-12-25 17:23:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:11,063 INFO L225 Difference]: With dead ends: 638 [2023-12-25 17:23:11,063 INFO L226 Difference]: Without dead ends: 391 [2023-12-25 17:23:11,064 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-25 17:23:11,064 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 410 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:11,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 890 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-25 17:23:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-25 17:23:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5535248041775458) internal successors, (595), 383 states have internal predecessors, (595), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2023-12-25 17:23:11,077 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 311 [2023-12-25 17:23:11,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:11,077 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2023-12-25 17:23:11,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 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-25 17:23:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2023-12-25 17:23:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-12-25 17:23:11,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:11,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:11,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-25 17:23:11,080 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:11,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash -342234970, now seen corresponding path program 1 times [2023-12-25 17:23:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:11,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175336765] [2023-12-25 17:23:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:11,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:11,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:11,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-12-25 17:23:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:11,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-12-25 17:23:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:11,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-25 17:23:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:11,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175336765] [2023-12-25 17:23:11,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175336765] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:11,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:11,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270313032] [2023-12-25 17:23:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:11,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:11,625 INFO L87 Difference]: Start difference. First operand 391 states and 607 transitions. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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-25 17:23:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:11,685 INFO L93 Difference]: Finished difference Result 638 states and 991 transitions. [2023-12-25 17:23:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:11,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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 312 [2023-12-25 17:23:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:11,687 INFO L225 Difference]: With dead ends: 638 [2023-12-25 17:23:11,688 INFO L226 Difference]: Without dead ends: 391 [2023-12-25 17:23:11,689 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-25 17:23:11,689 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 714 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:11,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 884 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-25 17:23:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-25 17:23:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5509138381201044) internal successors, (594), 383 states have internal predecessors, (594), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 606 transitions. [2023-12-25 17:23:11,701 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 606 transitions. Word has length 312 [2023-12-25 17:23:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:11,701 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 606 transitions. [2023-12-25 17:23:11,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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-25 17:23:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 606 transitions. [2023-12-25 17:23:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-12-25 17:23:11,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:11,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:11,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-25 17:23:11,724 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:11,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1107896516, now seen corresponding path program 1 times [2023-12-25 17:23:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:11,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884696588] [2023-12-25 17:23:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-25 17:23:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-25 17:23:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-25 17:23:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:12,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:12,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884696588] [2023-12-25 17:23:12,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884696588] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:12,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:12,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:12,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140855346] [2023-12-25 17:23:12,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:12,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:12,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:12,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:12,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:12,326 INFO L87 Difference]: Start difference. First operand 391 states and 606 transitions. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 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-25 17:23:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:12,375 INFO L93 Difference]: Finished difference Result 638 states and 989 transitions. [2023-12-25 17:23:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:12,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 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 313 [2023-12-25 17:23:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:12,382 INFO L225 Difference]: With dead ends: 638 [2023-12-25 17:23:12,382 INFO L226 Difference]: Without dead ends: 391 [2023-12-25 17:23:12,382 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-25 17:23:12,383 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 692 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:12,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 900 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-25 17:23:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-25 17:23:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5483028720626633) internal successors, (593), 383 states have internal predecessors, (593), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 605 transitions. [2023-12-25 17:23:12,394 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 605 transitions. Word has length 313 [2023-12-25 17:23:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:12,394 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 605 transitions. [2023-12-25 17:23:12,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 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-25 17:23:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 605 transitions. [2023-12-25 17:23:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-12-25 17:23:12,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:12,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:12,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-25 17:23:12,397 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:12,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 787072628, now seen corresponding path program 1 times [2023-12-25 17:23:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:12,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844184415] [2023-12-25 17:23:12,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:12,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-25 17:23:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-25 17:23:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-12-25 17:23:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:12,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:12,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844184415] [2023-12-25 17:23:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844184415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:12,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68299945] [2023-12-25 17:23:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:12,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:12,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:12,926 INFO L87 Difference]: Start difference. First operand 391 states and 605 transitions. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 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-25 17:23:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:12,971 INFO L93 Difference]: Finished difference Result 638 states and 987 transitions. [2023-12-25 17:23:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:12,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 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 314 [2023-12-25 17:23:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:12,973 INFO L225 Difference]: With dead ends: 638 [2023-12-25 17:23:12,973 INFO L226 Difference]: Without dead ends: 391 [2023-12-25 17:23:12,973 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-25 17:23:12,974 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 380 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:12,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 906 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-25 17:23:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-25 17:23:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5456919060052219) internal successors, (592), 383 states have internal predecessors, (592), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 604 transitions. [2023-12-25 17:23:12,986 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 604 transitions. Word has length 314 [2023-12-25 17:23:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:12,986 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 604 transitions. [2023-12-25 17:23:12,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 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-25 17:23:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 604 transitions. [2023-12-25 17:23:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-12-25 17:23:12,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:12,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:12,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-25 17:23:12,989 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:12,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash 624313872, now seen corresponding path program 1 times [2023-12-25 17:23:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:12,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12801986] [2023-12-25 17:23:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:12,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:13,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:13,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:13,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-25 17:23:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:13,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-25 17:23:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:13,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-25 17:23:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:13,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12801986] [2023-12-25 17:23:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12801986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:13,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:13,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:13,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867590683] [2023-12-25 17:23:13,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:13,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:13,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:13,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:13,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:13,543 INFO L87 Difference]: Start difference. First operand 391 states and 604 transitions. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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-25 17:23:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:13,744 INFO L93 Difference]: Finished difference Result 638 states and 985 transitions. [2023-12-25 17:23:13,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:13,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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 315 [2023-12-25 17:23:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:13,746 INFO L225 Difference]: With dead ends: 638 [2023-12-25 17:23:13,746 INFO L226 Difference]: Without dead ends: 391 [2023-12-25 17:23:13,746 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-25 17:23:13,747 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 654 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:13,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 674 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 17:23:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-25 17:23:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-25 17:23:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5430809399477807) internal successors, (591), 383 states have internal predecessors, (591), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 603 transitions. [2023-12-25 17:23:13,765 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 603 transitions. Word has length 315 [2023-12-25 17:23:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:13,765 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 603 transitions. [2023-12-25 17:23:13,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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-25 17:23:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 603 transitions. [2023-12-25 17:23:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-12-25 17:23:13,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:13,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:13,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-25 17:23:13,769 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:13,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1824240060, now seen corresponding path program 1 times [2023-12-25 17:23:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:13,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462279287] [2023-12-25 17:23:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:14,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:14,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:14,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-25 17:23:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-25 17:23:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-25 17:23:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:14,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462279287] [2023-12-25 17:23:14,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462279287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:14,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:14,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:14,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756094601] [2023-12-25 17:23:14,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:14,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:14,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:14,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:14,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:14,692 INFO L87 Difference]: Start difference. First operand 391 states and 603 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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-25 17:23:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:14,763 INFO L93 Difference]: Finished difference Result 638 states and 983 transitions. [2023-12-25 17:23:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:14,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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 316 [2023-12-25 17:23:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:14,766 INFO L225 Difference]: With dead ends: 638 [2023-12-25 17:23:14,766 INFO L226 Difference]: Without dead ends: 391 [2023-12-25 17:23:14,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-25 17:23:14,767 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 365 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:14,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 884 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-25 17:23:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-25 17:23:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5404699738903394) internal successors, (590), 383 states have internal predecessors, (590), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 602 transitions. [2023-12-25 17:23:14,779 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 602 transitions. Word has length 316 [2023-12-25 17:23:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:14,780 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 602 transitions. [2023-12-25 17:23:14,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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-25 17:23:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 602 transitions. [2023-12-25 17:23:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-12-25 17:23:14,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:14,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:14,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-25 17:23:14,782 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:14,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1253968254, now seen corresponding path program 1 times [2023-12-25 17:23:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:14,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991741393] [2023-12-25 17:23:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:15,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-25 17:23:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-25 17:23:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:15,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-25 17:23:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:15,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991741393] [2023-12-25 17:23:15,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991741393] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:15,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:15,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:15,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134040192] [2023-12-25 17:23:15,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:15,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:15,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:15,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:15,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:15,565 INFO L87 Difference]: Start difference. First operand 391 states and 602 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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-25 17:23:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:15,620 INFO L93 Difference]: Finished difference Result 638 states and 981 transitions. [2023-12-25 17:23:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:15,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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 316 [2023-12-25 17:23:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:15,622 INFO L225 Difference]: With dead ends: 638 [2023-12-25 17:23:15,622 INFO L226 Difference]: Without dead ends: 391 [2023-12-25 17:23:15,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-25 17:23:15,623 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 308 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:15,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 878 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-25 17:23:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-12-25 17:23:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5378590078328982) internal successors, (589), 383 states have internal predecessors, (589), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 601 transitions. [2023-12-25 17:23:15,635 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 601 transitions. Word has length 316 [2023-12-25 17:23:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:15,635 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 601 transitions. [2023-12-25 17:23:15,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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-25 17:23:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 601 transitions. [2023-12-25 17:23:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-12-25 17:23:15,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:15,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:15,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-25 17:23:15,638 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:15,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1271527428, now seen corresponding path program 1 times [2023-12-25 17:23:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166556977] [2023-12-25 17:23:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:16,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-25 17:23:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-25 17:23:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:16,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-25 17:23:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:16,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-25 17:23:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:16,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-25 17:23:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:16,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-25 17:23:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-25 17:23:16,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:16,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166556977] [2023-12-25 17:23:16,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166556977] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:16,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:16,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 17:23:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855947545] [2023-12-25 17:23:16,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:16,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 17:23:16,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:16,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 17:23:16,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 17:23:16,990 INFO L87 Difference]: Start difference. First operand 391 states and 601 transitions. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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-25 17:23:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:17,270 INFO L93 Difference]: Finished difference Result 830 states and 1270 transitions. [2023-12-25 17:23:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 17:23:17,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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 316 [2023-12-25 17:23:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:17,272 INFO L225 Difference]: With dead ends: 830 [2023-12-25 17:23:17,272 INFO L226 Difference]: Without dead ends: 399 [2023-12-25 17:23:17,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 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-25 17:23:17,273 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 952 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:17,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 1759 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 17:23:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-12-25 17:23:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2023-12-25 17:23:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 387 states have (on average 1.5271317829457365) internal successors, (591), 387 states have internal predecessors, (591), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 17:23:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 603 transitions. [2023-12-25 17:23:17,289 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 603 transitions. Word has length 316 [2023-12-25 17:23:17,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:17,289 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 603 transitions. [2023-12-25 17:23:17,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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-25 17:23:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 603 transitions. [2023-12-25 17:23:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-12-25 17:23:17,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:17,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:17,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-25 17:23:17,292 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:17,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash -84980268, now seen corresponding path program 1 times [2023-12-25 17:23:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214423180] [2023-12-25 17:23:17,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:18,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:18,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-25 17:23:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:18,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-25 17:23:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-12-25 17:23:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-25 17:23:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:18,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-25 17:23:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214423180] [2023-12-25 17:23:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214423180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 17:23:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132990900] [2023-12-25 17:23:18,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:18,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 17:23:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:18,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 17:23:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 17:23:18,268 INFO L87 Difference]: Start difference. First operand 395 states and 603 transitions. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-25 17:23:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:18,615 INFO L93 Difference]: Finished difference Result 967 states and 1479 transitions. [2023-12-25 17:23:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 17:23:18,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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 318 [2023-12-25 17:23:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:18,618 INFO L225 Difference]: With dead ends: 967 [2023-12-25 17:23:18,618 INFO L226 Difference]: Without dead ends: 718 [2023-12-25 17:23:18,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 17:23:18,619 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 311 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:18,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1923 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 17:23:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-12-25 17:23:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 610. [2023-12-25 17:23:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 599 states have (on average 1.5208681135225375) internal successors, (911), 599 states have internal predecessors, (911), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 929 transitions. [2023-12-25 17:23:18,640 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 929 transitions. Word has length 318 [2023-12-25 17:23:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:18,640 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 929 transitions. [2023-12-25 17:23:18,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-25 17:23:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 929 transitions. [2023-12-25 17:23:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-25 17:23:18,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:18,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:18,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-25 17:23:18,644 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:18,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash 964437772, now seen corresponding path program 1 times [2023-12-25 17:23:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:18,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725796164] [2023-12-25 17:23:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:18,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:19,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:19,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-25 17:23:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-25 17:23:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:19,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-25 17:23:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-25 17:23:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:19,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-25 17:23:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:19,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:19,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725796164] [2023-12-25 17:23:19,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725796164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:19,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:19,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 17:23:19,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151749191] [2023-12-25 17:23:19,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:19,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 17:23:19,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:19,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 17:23:19,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 17:23:19,711 INFO L87 Difference]: Start difference. First operand 610 states and 929 transitions. Second operand has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 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-25 17:23:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:20,045 INFO L93 Difference]: Finished difference Result 897 states and 1371 transitions. [2023-12-25 17:23:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 17:23:20,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 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 319 [2023-12-25 17:23:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:20,047 INFO L225 Difference]: With dead ends: 897 [2023-12-25 17:23:20,047 INFO L226 Difference]: Without dead ends: 648 [2023-12-25 17:23:20,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-25 17:23:20,048 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 865 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:20,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1318 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 17:23:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-12-25 17:23:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 611. [2023-12-25 17:23:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 600 states have (on average 1.52) internal successors, (912), 600 states have internal predecessors, (912), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 930 transitions. [2023-12-25 17:23:20,086 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 930 transitions. Word has length 319 [2023-12-25 17:23:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:20,087 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 930 transitions. [2023-12-25 17:23:20,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 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-25 17:23:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 930 transitions. [2023-12-25 17:23:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-25 17:23:20,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:20,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:20,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-25 17:23:20,090 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:20,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash -317734514, now seen corresponding path program 1 times [2023-12-25 17:23:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:20,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198432169] [2023-12-25 17:23:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:21,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:21,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-25 17:23:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-25 17:23:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-25 17:23:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-25 17:23:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-25 17:23:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-25 17:23:21,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:21,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198432169] [2023-12-25 17:23:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198432169] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:21,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 17:23:21,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188576013] [2023-12-25 17:23:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:21,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 17:23:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:21,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 17:23:21,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 17:23:21,112 INFO L87 Difference]: Start difference. First operand 611 states and 930 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 17:23:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:21,442 INFO L93 Difference]: Finished difference Result 1122 states and 1702 transitions. [2023-12-25 17:23:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 17:23:21,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 319 [2023-12-25 17:23:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:21,444 INFO L225 Difference]: With dead ends: 1122 [2023-12-25 17:23:21,444 INFO L226 Difference]: Without dead ends: 623 [2023-12-25 17:23:21,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-25 17:23:21,445 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 815 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:21,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1130 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 17:23:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-12-25 17:23:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 617. [2023-12-25 17:23:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 606 states have (on average 1.50990099009901) internal successors, (915), 606 states have internal predecessors, (915), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 933 transitions. [2023-12-25 17:23:21,470 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 933 transitions. Word has length 319 [2023-12-25 17:23:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:21,470 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 933 transitions. [2023-12-25 17:23:21,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 17:23:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 933 transitions. [2023-12-25 17:23:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-12-25 17:23:21,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:21,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:21,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-25 17:23:21,474 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:21,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1301267710, now seen corresponding path program 1 times [2023-12-25 17:23:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:21,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065345630] [2023-12-25 17:23:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:23,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:23,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-25 17:23:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-25 17:23:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:23,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-25 17:23:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:23,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-12-25 17:23:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-12-25 17:23:23,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:23,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065345630] [2023-12-25 17:23:23,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065345630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:23,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:23,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 17:23:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483705742] [2023-12-25 17:23:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:23,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 17:23:23,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 17:23:23,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-25 17:23:23,536 INFO L87 Difference]: Start difference. First operand 617 states and 933 transitions. Second operand has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 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-25 17:23:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:24,240 INFO L93 Difference]: Finished difference Result 1731 states and 2618 transitions. [2023-12-25 17:23:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 17:23:24,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 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 321 [2023-12-25 17:23:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:24,243 INFO L225 Difference]: With dead ends: 1731 [2023-12-25 17:23:24,243 INFO L226 Difference]: Without dead ends: 1196 [2023-12-25 17:23:24,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-12-25 17:23:24,244 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 2163 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:24,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 1877 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 17:23:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2023-12-25 17:23:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 627. [2023-12-25 17:23:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 616 states have (on average 1.5016233766233766) internal successors, (925), 616 states have internal predecessors, (925), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 943 transitions. [2023-12-25 17:23:24,261 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 943 transitions. Word has length 321 [2023-12-25 17:23:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:24,261 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 943 transitions. [2023-12-25 17:23:24,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 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-25 17:23:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 943 transitions. [2023-12-25 17:23:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-12-25 17:23:24,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:24,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:24,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-25 17:23:24,263 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:24,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash 440375488, now seen corresponding path program 1 times [2023-12-25 17:23:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886802366] [2023-12-25 17:23:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:24,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:25,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-25 17:23:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-25 17:23:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-25 17:23:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:25,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-12-25 17:23:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-25 17:23:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886802366] [2023-12-25 17:23:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886802366] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 17:23:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556696589] [2023-12-25 17:23:25,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:25,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:23:25,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:23:25,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 17:23:25,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-25 17:23:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:25,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 2072 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 17:23:25,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 17:23:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 17:23:26,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 17:23:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 17:23:26,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556696589] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 17:23:26,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-25 17:23:26,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 10] total 17 [2023-12-25 17:23:26,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860534555] [2023-12-25 17:23:26,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:26,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 17:23:26,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:26,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 17:23:26,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-12-25 17:23:26,311 INFO L87 Difference]: Start difference. First operand 627 states and 943 transitions. Second operand has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 17:23:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:26,354 INFO L93 Difference]: Finished difference Result 1102 states and 1655 transitions. [2023-12-25 17:23:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 17:23:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 321 [2023-12-25 17:23:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:26,357 INFO L225 Difference]: With dead ends: 1102 [2023-12-25 17:23:26,358 INFO L226 Difference]: Without dead ends: 627 [2023-12-25 17:23:26,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-12-25 17:23:26,359 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 0 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:26,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1800 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-12-25 17:23:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2023-12-25 17:23:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 616 states have (on average 1.4967532467532467) internal successors, (922), 616 states have internal predecessors, (922), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 940 transitions. [2023-12-25 17:23:26,375 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 940 transitions. Word has length 321 [2023-12-25 17:23:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:26,375 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 940 transitions. [2023-12-25 17:23:26,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 17:23:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 940 transitions. [2023-12-25 17:23:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-25 17:23:26,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:26,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:26,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-25 17:23:26,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-25 17:23:26,585 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:26,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash -328816116, now seen corresponding path program 1 times [2023-12-25 17:23:26,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:26,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513128675] [2023-12-25 17:23:26,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:27,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-25 17:23:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-25 17:23:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:27,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-25 17:23:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-25 17:23:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-25 17:23:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513128675] [2023-12-25 17:23:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513128675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:27,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:27,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:27,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267039808] [2023-12-25 17:23:27,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:27,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:27,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:27,575 INFO L87 Difference]: Start difference. First operand 627 states and 940 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-25 17:23:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:27,737 INFO L93 Difference]: Finished difference Result 1042 states and 1554 transitions. [2023-12-25 17:23:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:27,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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 323 [2023-12-25 17:23:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:27,741 INFO L225 Difference]: With dead ends: 1042 [2023-12-25 17:23:27,741 INFO L226 Difference]: Without dead ends: 627 [2023-12-25 17:23:27,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:27,742 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 367 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:27,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 680 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:23:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-12-25 17:23:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2023-12-25 17:23:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 616 states have (on average 1.4918831168831168) internal successors, (919), 616 states have internal predecessors, (919), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 937 transitions. [2023-12-25 17:23:27,756 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 937 transitions. Word has length 323 [2023-12-25 17:23:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:27,757 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 937 transitions. [2023-12-25 17:23:27,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-25 17:23:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 937 transitions. [2023-12-25 17:23:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-25 17:23:27,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:27,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:27,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-25 17:23:27,759 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:27,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash 451398220, now seen corresponding path program 1 times [2023-12-25 17:23:27,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:27,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131102248] [2023-12-25 17:23:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:28,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:28,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-25 17:23:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-25 17:23:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:28,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-25 17:23:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-25 17:23:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-25 17:23:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131102248] [2023-12-25 17:23:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131102248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:28,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 17:23:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908718787] [2023-12-25 17:23:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:28,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 17:23:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:28,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 17:23:28,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 17:23:28,910 INFO L87 Difference]: Start difference. First operand 627 states and 937 transitions. Second operand has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 17:23:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:29,493 INFO L93 Difference]: Finished difference Result 1535 states and 2290 transitions. [2023-12-25 17:23:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 17:23:29,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 323 [2023-12-25 17:23:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:29,497 INFO L225 Difference]: With dead ends: 1535 [2023-12-25 17:23:29,497 INFO L226 Difference]: Without dead ends: 1126 [2023-12-25 17:23:29,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-25 17:23:29,500 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 1129 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:29,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 3085 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 17:23:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2023-12-25 17:23:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1119. [2023-12-25 17:23:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1101 states have (on average 1.4922797456857402) internal successors, (1643), 1101 states have internal predecessors, (1643), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 17:23:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1675 transitions. [2023-12-25 17:23:29,529 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1675 transitions. Word has length 323 [2023-12-25 17:23:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:29,530 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 1675 transitions. [2023-12-25 17:23:29,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 17:23:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1675 transitions. [2023-12-25 17:23:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-25 17:23:29,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:29,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:29,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-25 17:23:29,534 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:29,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash 62165516, now seen corresponding path program 1 times [2023-12-25 17:23:29,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:29,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517519581] [2023-12-25 17:23:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:29,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-25 17:23:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:30,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-25 17:23:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-25 17:23:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-25 17:23:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 61 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-25 17:23:30,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517519581] [2023-12-25 17:23:30,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517519581] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 17:23:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716337951] [2023-12-25 17:23:30,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:30,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:23:30,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:23:30,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 17:23:30,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-25 17:23:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:31,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 2084 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 17:23:31,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 17:23:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-25 17:23:31,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 17:23:31,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716337951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:31,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 17:23:31,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-25 17:23:31,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480909270] [2023-12-25 17:23:31,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:31,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:31,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:31,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 17:23:31,222 INFO L87 Difference]: Start difference. First operand 1119 states and 1675 transitions. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 17:23:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:31,393 INFO L93 Difference]: Finished difference Result 1572 states and 2348 transitions. [2023-12-25 17:23:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2023-12-25 17:23:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:31,395 INFO L225 Difference]: With dead ends: 1572 [2023-12-25 17:23:31,395 INFO L226 Difference]: Without dead ends: 630 [2023-12-25 17:23:31,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-25 17:23:31,396 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 366 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:31,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 666 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 17:23:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2023-12-25 17:23:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2023-12-25 17:23:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 619 states have (on average 1.4846526655896608) internal successors, (919), 619 states have internal predecessors, (919), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 937 transitions. [2023-12-25 17:23:31,418 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 937 transitions. Word has length 323 [2023-12-25 17:23:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:31,418 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 937 transitions. [2023-12-25 17:23:31,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 17:23:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 937 transitions. [2023-12-25 17:23:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-25 17:23:31,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:31,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:31,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-25 17:23:31,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-25 17:23:31,628 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:31,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1076970868, now seen corresponding path program 1 times [2023-12-25 17:23:31,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:31,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691919445] [2023-12-25 17:23:31,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:31,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:32,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-25 17:23:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:32,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-25 17:23:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-25 17:23:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:32,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-25 17:23:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-25 17:23:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:32,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691919445] [2023-12-25 17:23:32,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691919445] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 17:23:32,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035127957] [2023-12-25 17:23:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:32,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:23:32,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:23:32,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 17:23:32,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-25 17:23:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:33,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 2084 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-25 17:23:33,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 17:23:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 17:23:33,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 17:23:33,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035127957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:33,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 17:23:33,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 11 [2023-12-25 17:23:33,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347050241] [2023-12-25 17:23:33,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:33,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 17:23:33,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:33,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 17:23:33,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 17:23:33,591 INFO L87 Difference]: Start difference. First operand 630 states and 937 transitions. Second operand has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 17:23:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:33,954 INFO L93 Difference]: Finished difference Result 1166 states and 1729 transitions. [2023-12-25 17:23:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 17:23:33,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2023-12-25 17:23:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:33,956 INFO L225 Difference]: With dead ends: 1166 [2023-12-25 17:23:33,956 INFO L226 Difference]: Without dead ends: 636 [2023-12-25 17:23:33,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-12-25 17:23:33,957 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 783 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:33,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1499 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 17:23:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2023-12-25 17:23:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 627. [2023-12-25 17:23:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 616 states have (on average 1.4870129870129871) internal successors, (916), 616 states have internal predecessors, (916), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 934 transitions. [2023-12-25 17:23:33,972 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 934 transitions. Word has length 323 [2023-12-25 17:23:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:33,972 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 934 transitions. [2023-12-25 17:23:33,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 17:23:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 934 transitions. [2023-12-25 17:23:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-25 17:23:33,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:33,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-25 17:23:34,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:23:34,183 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:34,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1847704434, now seen corresponding path program 1 times [2023-12-25 17:23:34,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373794469] [2023-12-25 17:23:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-25 17:23:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-25 17:23:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-25 17:23:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-25 17:23:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-25 17:23:35,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:35,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373794469] [2023-12-25 17:23:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373794469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249266166] [2023-12-25 17:23:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:35,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:35,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:35,276 INFO L87 Difference]: Start difference. First operand 627 states and 934 transitions. Second operand has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 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-25 17:23:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:35,337 INFO L93 Difference]: Finished difference Result 1477 states and 2179 transitions. [2023-12-25 17:23:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 17:23:35,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 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 323 [2023-12-25 17:23:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:35,341 INFO L225 Difference]: With dead ends: 1477 [2023-12-25 17:23:35,341 INFO L226 Difference]: Without dead ends: 1114 [2023-12-25 17:23:35,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-25 17:23:35,341 INFO L413 NwaCegarLoop]: 809 mSDtfsCounter, 725 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 2553 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-25 17:23:35,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 2553 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2023-12-25 17:23:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 723. [2023-12-25 17:23:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 712 states have (on average 1.446629213483146) internal successors, (1030), 712 states have internal predecessors, (1030), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1048 transitions. [2023-12-25 17:23:35,357 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1048 transitions. Word has length 323 [2023-12-25 17:23:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:35,358 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 1048 transitions. [2023-12-25 17:23:35,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 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-25 17:23:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1048 transitions. [2023-12-25 17:23:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-12-25 17:23:35,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:35,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:35,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-25 17:23:35,360 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:35,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1312807558, now seen corresponding path program 1 times [2023-12-25 17:23:35,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:35,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999965814] [2023-12-25 17:23:35,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:35,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-25 17:23:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-25 17:23:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-25 17:23:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-12-25 17:23:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-25 17:23:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:35,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999965814] [2023-12-25 17:23:35,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999965814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:35,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:35,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 17:23:35,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452451631] [2023-12-25 17:23:35,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:35,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:23:35,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:35,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:23:35,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:35,761 INFO L87 Difference]: Start difference. First operand 723 states and 1048 transitions. Second operand has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 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-25 17:23:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:35,814 INFO L93 Difference]: Finished difference Result 1664 states and 2426 transitions. [2023-12-25 17:23:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 17:23:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 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 325 [2023-12-25 17:23:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:35,817 INFO L225 Difference]: With dead ends: 1664 [2023-12-25 17:23:35,817 INFO L226 Difference]: Without dead ends: 1201 [2023-12-25 17:23:35,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-25 17:23:35,818 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 723 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:35,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1987 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2023-12-25 17:23:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 765. [2023-12-25 17:23:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 754 states have (on average 1.453580901856764) internal successors, (1096), 754 states have internal predecessors, (1096), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 17:23:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1114 transitions. [2023-12-25 17:23:35,838 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1114 transitions. Word has length 325 [2023-12-25 17:23:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:35,839 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1114 transitions. [2023-12-25 17:23:35,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 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-25 17:23:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1114 transitions. [2023-12-25 17:23:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-12-25 17:23:35,841 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:35,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:35,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-25 17:23:35,841 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:35,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1442351746, now seen corresponding path program 1 times [2023-12-25 17:23:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:35,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506904216] [2023-12-25 17:23:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:37,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:37,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-25 17:23:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:37,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-25 17:23:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:37,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-25 17:23:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:37,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-12-25 17:23:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-12-25 17:23:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:37,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506904216] [2023-12-25 17:23:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506904216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:37,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 17:23:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216398191] [2023-12-25 17:23:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:37,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 17:23:37,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 17:23:37,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 17:23:37,153 INFO L87 Difference]: Start difference. First operand 765 states and 1114 transitions. Second operand has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 17:23:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:38,432 INFO L93 Difference]: Finished difference Result 2514 states and 3628 transitions. [2023-12-25 17:23:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 17:23:38,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 325 [2023-12-25 17:23:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:38,438 INFO L225 Difference]: With dead ends: 2514 [2023-12-25 17:23:38,438 INFO L226 Difference]: Without dead ends: 1953 [2023-12-25 17:23:38,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-25 17:23:38,439 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 2031 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:38,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 2357 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 17:23:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2023-12-25 17:23:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 861. [2023-12-25 17:23:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 847 states have (on average 1.4604486422668241) internal successors, (1237), 847 states have internal predecessors, (1237), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 17:23:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1261 transitions. [2023-12-25 17:23:38,463 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1261 transitions. Word has length 325 [2023-12-25 17:23:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:38,464 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 1261 transitions. [2023-12-25 17:23:38,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 17:23:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1261 transitions. [2023-12-25 17:23:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-25 17:23:38,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:38,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:38,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-25 17:23:38,466 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:38,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash -64243890, now seen corresponding path program 1 times [2023-12-25 17:23:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041810540] [2023-12-25 17:23:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:39,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:39,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-25 17:23:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-25 17:23:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-25 17:23:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-25 17:23:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:39,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:39,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041810540] [2023-12-25 17:23:39,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041810540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:39,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:39,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 17:23:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223278227] [2023-12-25 17:23:39,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:39,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 17:23:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:39,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 17:23:39,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 17:23:39,690 INFO L87 Difference]: Start difference. First operand 861 states and 1261 transitions. Second operand has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 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-25 17:23:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:40,239 INFO L93 Difference]: Finished difference Result 1767 states and 2571 transitions. [2023-12-25 17:23:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 17:23:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 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 327 [2023-12-25 17:23:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:40,243 INFO L225 Difference]: With dead ends: 1767 [2023-12-25 17:23:40,243 INFO L226 Difference]: Without dead ends: 1355 [2023-12-25 17:23:40,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-25 17:23:40,244 INFO L413 NwaCegarLoop]: 568 mSDtfsCounter, 663 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:40,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 2137 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 17:23:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2023-12-25 17:23:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1149. [2023-12-25 17:23:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1135 states have (on average 1.4220264317180618) internal successors, (1614), 1135 states have internal predecessors, (1614), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 17:23:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1638 transitions. [2023-12-25 17:23:40,273 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1638 transitions. Word has length 327 [2023-12-25 17:23:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:40,274 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1638 transitions. [2023-12-25 17:23:40,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 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-25 17:23:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1638 transitions. [2023-12-25 17:23:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-25 17:23:40,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:40,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:40,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-25 17:23:40,277 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:40,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1021181660, now seen corresponding path program 1 times [2023-12-25 17:23:40,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:40,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193394296] [2023-12-25 17:23:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-25 17:23:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-25 17:23:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:40,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-25 17:23:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:40,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-25 17:23:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-25 17:23:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:40,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193394296] [2023-12-25 17:23:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193394296] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:40,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:23:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:23:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672047501] [2023-12-25 17:23:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:40,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:23:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:23:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:23:40,883 INFO L87 Difference]: Start difference. First operand 1149 states and 1638 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 17:23:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:40,924 INFO L93 Difference]: Finished difference Result 2142 states and 3038 transitions. [2023-12-25 17:23:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:23:40,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 327 [2023-12-25 17:23:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:40,927 INFO L225 Difference]: With dead ends: 2142 [2023-12-25 17:23:40,927 INFO L226 Difference]: Without dead ends: 1149 [2023-12-25 17:23:40,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:23:40,928 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 746 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:40,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 620 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:23:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-12-25 17:23:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2023-12-25 17:23:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1135 states have (on average 1.4167400881057268) internal successors, (1608), 1135 states have internal predecessors, (1608), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 17:23:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1632 transitions. [2023-12-25 17:23:40,953 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1632 transitions. Word has length 327 [2023-12-25 17:23:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:40,953 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1632 transitions. [2023-12-25 17:23:40,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 17:23:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1632 transitions. [2023-12-25 17:23:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-25 17:23:40,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:40,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:40,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-25 17:23:40,956 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:40,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1108752802, now seen corresponding path program 1 times [2023-12-25 17:23:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702264096] [2023-12-25 17:23:40,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:40,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:42,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-25 17:23:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-25 17:23:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:42,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-25 17:23:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:42,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-25 17:23:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 4 proven. 77 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702264096] [2023-12-25 17:23:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702264096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 17:23:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938984678] [2023-12-25 17:23:42,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:42,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:23:42,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:23:42,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 17:23:42,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-25 17:23:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:43,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 2098 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 17:23:43,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 17:23:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 17:23:43,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 17:23:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938984678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:23:43,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 17:23:43,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2023-12-25 17:23:43,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21893932] [2023-12-25 17:23:43,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:23:43,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 17:23:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:43,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 17:23:43,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2023-12-25 17:23:43,409 INFO L87 Difference]: Start difference. First operand 1149 states and 1632 transitions. Second operand has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 17:23:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:23:44,011 INFO L93 Difference]: Finished difference Result 3118 states and 4469 transitions. [2023-12-25 17:23:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 17:23:44,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2023-12-25 17:23:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:23:44,024 INFO L225 Difference]: With dead ends: 3118 [2023-12-25 17:23:44,024 INFO L226 Difference]: Without dead ends: 2541 [2023-12-25 17:23:44,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-12-25 17:23:44,025 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 1304 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 17:23:44,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 2725 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 17:23:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2023-12-25 17:23:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 1659. [2023-12-25 17:23:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1637 states have (on average 1.3903481979230299) internal successors, (2276), 1637 states have internal predecessors, (2276), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-25 17:23:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2316 transitions. [2023-12-25 17:23:44,071 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2316 transitions. Word has length 327 [2023-12-25 17:23:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:23:44,073 INFO L495 AbstractCegarLoop]: Abstraction has 1659 states and 2316 transitions. [2023-12-25 17:23:44,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 17:23:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2316 transitions. [2023-12-25 17:23:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-25 17:23:44,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:23:44,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:23:44,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-25 17:23:44,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:23:44,286 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:23:44,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:23:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2050270048, now seen corresponding path program 1 times [2023-12-25 17:23:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:23:44,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075027352] [2023-12-25 17:23:44,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:23:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:23:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:46,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:23:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-25 17:23:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-25 17:23:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:46,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-25 17:23:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:46,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-25 17:23:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 4 proven. 77 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:23:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075027352] [2023-12-25 17:23:46,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075027352] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 17:23:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121248746] [2023-12-25 17:23:46,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:23:46,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:23:46,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:23:46,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 17:23:46,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-25 17:23:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:23:46,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 2099 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-25 17:23:46,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 17:23:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 17:23:47,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 17:23:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 55 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:23:51,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121248746] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 17:23:51,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 17:23:51,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 25] total 48 [2023-12-25 17:23:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593367033] [2023-12-25 17:23:51,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 17:23:51,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-25 17:23:51,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:23:51,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-25 17:23:51,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1984, Unknown=0, NotChecked=0, Total=2256 [2023-12-25 17:23:51,194 INFO L87 Difference]: Start difference. First operand 1659 states and 2316 transitions. Second operand has 48 states, 48 states have (on average 17.645833333333332) internal successors, (847), 48 states have internal predecessors, (847), 9 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2023-12-25 17:24:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:24:17,217 INFO L93 Difference]: Finished difference Result 21468 states and 30262 transitions. [2023-12-25 17:24:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 294 states. [2023-12-25 17:24:17,217 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 17.645833333333332) internal successors, (847), 48 states have internal predecessors, (847), 9 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 327 [2023-12-25 17:24:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:24:17,242 INFO L225 Difference]: With dead ends: 21468 [2023-12-25 17:24:17,242 INFO L226 Difference]: Without dead ends: 20235 [2023-12-25 17:24:17,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42155 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=11610, Invalid=99612, Unknown=0, NotChecked=0, Total=111222 [2023-12-25 17:24:17,259 INFO L413 NwaCegarLoop]: 2168 mSDtfsCounter, 44518 mSDsluCounter, 47593 mSDsCounter, 0 mSdLazyCounter, 25120 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44523 SdHoareTripleChecker+Valid, 49761 SdHoareTripleChecker+Invalid, 25260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 25120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-12-25 17:24:17,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44523 Valid, 49761 Invalid, 25260 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [140 Valid, 25120 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2023-12-25 17:24:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20235 states. [2023-12-25 17:24:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20235 to 1703. [2023-12-25 17:24:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1681 states have (on average 1.3813206424747175) internal successors, (2322), 1681 states have internal predecessors, (2322), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-25 17:24:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2362 transitions. [2023-12-25 17:24:17,377 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2362 transitions. Word has length 327 [2023-12-25 17:24:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:24:17,378 INFO L495 AbstractCegarLoop]: Abstraction has 1703 states and 2362 transitions. [2023-12-25 17:24:17,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 17.645833333333332) internal successors, (847), 48 states have internal predecessors, (847), 9 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2023-12-25 17:24:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2362 transitions. [2023-12-25 17:24:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-25 17:24:17,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:24:17,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:24:17,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-25 17:24:17,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-12-25 17:24:17,591 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:24:17,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:24:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash -804869704, now seen corresponding path program 1 times [2023-12-25 17:24:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:24:17,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580911845] [2023-12-25 17:24:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:24:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:24:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:24:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:24:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-25 17:24:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-25 17:24:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:18,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-25 17:24:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-25 17:24:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 77 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:24:18,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:24:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580911845] [2023-12-25 17:24:18,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580911845] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 17:24:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443775367] [2023-12-25 17:24:18,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:24:18,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:24:18,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:24:18,943 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 17:24:18,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-25 17:24:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:19,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 2100 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 17:24:19,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 17:24:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 113 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 17:24:19,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 17:24:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-25 17:24:19,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443775367] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 17:24:19,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 17:24:19,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 18 [2023-12-25 17:24:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981520008] [2023-12-25 17:24:19,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 17:24:19,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 17:24:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:24:19,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 17:24:19,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-12-25 17:24:19,564 INFO L87 Difference]: Start difference. First operand 1703 states and 2362 transitions. Second operand has 18 states, 16 states have (on average 37.6875) internal successors, (603), 18 states have internal predecessors, (603), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-25 17:24:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:24:20,333 INFO L93 Difference]: Finished difference Result 3288 states and 4534 transitions. [2023-12-25 17:24:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 17:24:20,333 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 37.6875) internal successors, (603), 18 states have internal predecessors, (603), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 327 [2023-12-25 17:24:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:24:20,336 INFO L225 Difference]: With dead ends: 3288 [2023-12-25 17:24:20,336 INFO L226 Difference]: Without dead ends: 1723 [2023-12-25 17:24:20,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2023-12-25 17:24:20,338 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 1046 mSDsluCounter, 3567 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 3885 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 17:24:20,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 3885 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 17:24:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2023-12-25 17:24:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1703. [2023-12-25 17:24:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1681 states have (on average 1.3783462224866152) internal successors, (2317), 1681 states have internal predecessors, (2317), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-25 17:24:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2357 transitions. [2023-12-25 17:24:20,373 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2357 transitions. Word has length 327 [2023-12-25 17:24:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:24:20,374 INFO L495 AbstractCegarLoop]: Abstraction has 1703 states and 2357 transitions. [2023-12-25 17:24:20,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 37.6875) internal successors, (603), 18 states have internal predecessors, (603), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-25 17:24:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2357 transitions. [2023-12-25 17:24:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2023-12-25 17:24:20,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:24:20,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:24:20,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-25 17:24:20,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:24:20,582 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:24:20,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:24:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1093417914, now seen corresponding path program 1 times [2023-12-25 17:24:20,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:24:20,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308601031] [2023-12-25 17:24:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:24:20,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:24:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:23,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-25 17:24:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-25 17:24:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:23,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-25 17:24:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-25 17:24:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:23,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-25 17:24:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:23,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2023-12-25 17:24:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 35 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:24:23,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:24:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308601031] [2023-12-25 17:24:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308601031] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 17:24:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414501661] [2023-12-25 17:24:23,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:24:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 17:24:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:24:23,785 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 17:24:23,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-25 17:24:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:24:24,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 2103 conjuncts, 193 conjunts are in the unsatisfiable core [2023-12-25 17:24:24,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 17:24:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:24:27,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 17:24:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 41 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 17:24:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414501661] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 17:24:34,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 17:24:34,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 44, 42] total 94 [2023-12-25 17:24:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61282947] [2023-12-25 17:24:34,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 17:24:34,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-12-25 17:24:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:24:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-12-25 17:24:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1070, Invalid=7672, Unknown=0, NotChecked=0, Total=8742 [2023-12-25 17:24:34,776 INFO L87 Difference]: Start difference. First operand 1703 states and 2357 transitions. Second operand has 94 states, 94 states have (on average 9.01063829787234) internal successors, (847), 94 states have internal predecessors, (847), 14 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18)