./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label53.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c75028c45c8bfe0f1d4af80312d164394cbdbf8280624d50449e86195205937 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:20:56,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:20:56,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:20:56,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:20:56,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:20:56,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:20:56,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:20:56,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:20:56,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:20:56,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:20:56,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:20:56,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:20:56,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:20:56,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:20:56,607 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:20:56,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:20:56,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:20:56,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:20:56,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:20:56,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:20:56,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:20:56,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:20:56,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:20:56,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:20:56,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:20:56,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:20:56,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:20:56,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:20:56,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:20:56,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:20:56,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:20:56,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:20:56,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:20:56,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:20:56,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:20:56,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:20:56,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:20:56,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:20:56,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:20:56,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:20:56,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:20:56,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:20:56,619 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c75028c45c8bfe0f1d4af80312d164394cbdbf8280624d50449e86195205937 [2024-10-12 15:20:56,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:20:56,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:20:56,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:20:56,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:20:56,974 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:20:56,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label53.c [2024-10-12 15:20:58,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:20:58,862 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:20:58,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label53.c [2024-10-12 15:20:58,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083a996f2/c39dfbb4d4cb45e9b049f7ca039b0124/FLAG734d3f619 [2024-10-12 15:20:59,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083a996f2/c39dfbb4d4cb45e9b049f7ca039b0124 [2024-10-12 15:20:59,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:20:59,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:20:59,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:20:59,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:20:59,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:20:59,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:20:59,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c0d914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59, skipping insertion in model container [2024-10-12 15:20:59,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:20:59,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:20:59,693 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label53.c[60419,60432] [2024-10-12 15:20:59,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:20:59,742 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:20:59,911 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label53.c[60419,60432] [2024-10-12 15:20:59,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:20:59,968 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:20:59,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59 WrapperNode [2024-10-12 15:20:59,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:20:59,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:20:59,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:20:59,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:20:59,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,119 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-12 15:21:00,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:21:00,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:21:00,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:21:00,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:21:00,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,182 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]. [2024-10-12 15:21:00,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:21:00,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:21:00,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:21:00,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:21:00,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (1/1) ... [2024-10-12 15:21:00,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:21:00,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:00,315 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) [2024-10-12 15:21:00,317 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 [2024-10-12 15:21:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:21:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:21:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:21:00,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:21:00,516 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:21:00,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:21:02,322 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-12 15:21:02,322 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:21:02,411 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:21:02,411 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:21:02,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:21:02 BoogieIcfgContainer [2024-10-12 15:21:02,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:21:02,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:21:02,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:21:02,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:21:02,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:20:59" (1/3) ... [2024-10-12 15:21:02,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3230e625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:21:02, skipping insertion in model container [2024-10-12 15:21:02,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:59" (2/3) ... [2024-10-12 15:21:02,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3230e625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:21:02, skipping insertion in model container [2024-10-12 15:21:02,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:21:02" (3/3) ... [2024-10-12 15:21:02,421 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label53.c [2024-10-12 15:21:02,437 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:21:02,437 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:21:02,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:21:02,525 INFO L333 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, 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;@2cab5ec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:21:02,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:21:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-12 15:21:02,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:02,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:02,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:02,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:02,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1180067737, now seen corresponding path program 1 times [2024-10-12 15:21:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:02,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718227910] [2024-10-12 15:21:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:03,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718227910] [2024-10-12 15:21:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718227910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:03,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54972417] [2024-10-12 15:21:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:03,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:21:03,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:03,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:21:03,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:21:03,203 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:03,261 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-12 15:21:03,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:21:03,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2024-10-12 15:21:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:03,281 INFO L225 Difference]: With dead ends: 479 [2024-10-12 15:21:03,282 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:21:03,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:21:03,291 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:03,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:21:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:21:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-12 15:21:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-12 15:21:03,354 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 193 [2024-10-12 15:21:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:03,355 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-12 15:21:03,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-12 15:21:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-12 15:21:03,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:03,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:03,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:21:03,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:03,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1166153593, now seen corresponding path program 1 times [2024-10-12 15:21:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:03,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661119945] [2024-10-12 15:21:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661119945] [2024-10-12 15:21:03,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661119945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:03,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:03,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907969653] [2024-10-12 15:21:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:03,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:03,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:03,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:03,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:03,849 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:04,914 INFO L93 Difference]: Finished difference Result 699 states and 1160 transitions. [2024-10-12 15:21:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2024-10-12 15:21:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:04,918 INFO L225 Difference]: With dead ends: 699 [2024-10-12 15:21:04,918 INFO L226 Difference]: Without dead ends: 462 [2024-10-12 15:21:04,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:04,920 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:04,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 15:21:04,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-12 15:21:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 448. [2024-10-12 15:21:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.6196868008948546) internal successors, (724), 447 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 724 transitions. [2024-10-12 15:21:04,947 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 724 transitions. Word has length 193 [2024-10-12 15:21:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:04,948 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 724 transitions. [2024-10-12 15:21:04,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 724 transitions. [2024-10-12 15:21:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-12 15:21:04,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:04,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:04,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:21:04,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:04,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash -662510531, now seen corresponding path program 1 times [2024-10-12 15:21:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:04,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657938018] [2024-10-12 15:21:04,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:05,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:05,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657938018] [2024-10-12 15:21:05,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657938018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:05,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:05,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746011051] [2024-10-12 15:21:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:05,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:05,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:05,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:05,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:05,228 INFO L87 Difference]: Start difference. First operand 448 states and 724 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:06,039 INFO L93 Difference]: Finished difference Result 1318 states and 2137 transitions. [2024-10-12 15:21:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:06,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2024-10-12 15:21:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:06,044 INFO L225 Difference]: With dead ends: 1318 [2024-10-12 15:21:06,044 INFO L226 Difference]: Without dead ends: 871 [2024-10-12 15:21:06,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:06,048 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:06,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 148 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-12 15:21:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2024-10-12 15:21:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.512672811059908) internal successors, (1313), 868 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1313 transitions. [2024-10-12 15:21:06,100 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1313 transitions. Word has length 198 [2024-10-12 15:21:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:06,100 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1313 transitions. [2024-10-12 15:21:06,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1313 transitions. [2024-10-12 15:21:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-12 15:21:06,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:06,104 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:06,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:21:06,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:06,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1387193421, now seen corresponding path program 1 times [2024-10-12 15:21:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:06,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507421440] [2024-10-12 15:21:06,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:06,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:06,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:06,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507421440] [2024-10-12 15:21:06,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507421440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:06,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:06,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:06,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225947010] [2024-10-12 15:21:06,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:06,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:06,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:06,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:06,495 INFO L87 Difference]: Start difference. First operand 869 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:07,318 INFO L93 Difference]: Finished difference Result 2553 states and 3868 transitions. [2024-10-12 15:21:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:07,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2024-10-12 15:21:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:07,326 INFO L225 Difference]: With dead ends: 2553 [2024-10-12 15:21:07,326 INFO L226 Difference]: Without dead ends: 1685 [2024-10-12 15:21:07,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:07,333 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 232 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:07,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 414 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-10-12 15:21:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1683. [2024-10-12 15:21:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.3365041617122473) internal successors, (2248), 1682 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2248 transitions. [2024-10-12 15:21:07,392 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2248 transitions. Word has length 213 [2024-10-12 15:21:07,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:07,393 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2248 transitions. [2024-10-12 15:21:07,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2248 transitions. [2024-10-12 15:21:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-12 15:21:07,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:07,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:07,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:21:07,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:07,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1459038512, now seen corresponding path program 1 times [2024-10-12 15:21:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:07,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431868402] [2024-10-12 15:21:07,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:07,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:07,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431868402] [2024-10-12 15:21:07,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431868402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:07,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:07,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999396828] [2024-10-12 15:21:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:07,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:07,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:07,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:07,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:07,704 INFO L87 Difference]: Start difference. First operand 1683 states and 2248 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:08,503 INFO L93 Difference]: Finished difference Result 5016 states and 6706 transitions. [2024-10-12 15:21:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2024-10-12 15:21:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:08,516 INFO L225 Difference]: With dead ends: 5016 [2024-10-12 15:21:08,516 INFO L226 Difference]: Without dead ends: 3334 [2024-10-12 15:21:08,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:08,520 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 259 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:08,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 121 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2024-10-12 15:21:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3325. [2024-10-12 15:21:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 3324 states have (on average 1.3231046931407942) internal successors, (4398), 3324 states have internal predecessors, (4398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 4398 transitions. [2024-10-12 15:21:08,592 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 4398 transitions. Word has length 216 [2024-10-12 15:21:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:08,593 INFO L471 AbstractCegarLoop]: Abstraction has 3325 states and 4398 transitions. [2024-10-12 15:21:08,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 4398 transitions. [2024-10-12 15:21:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-12 15:21:08,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:08,603 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:08,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:21:08,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:08,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:08,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1307822638, now seen corresponding path program 1 times [2024-10-12 15:21:08,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:08,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088940527] [2024-10-12 15:21:08,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:08,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088940527] [2024-10-12 15:21:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088940527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:08,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:08,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261868369] [2024-10-12 15:21:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:08,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:08,889 INFO L87 Difference]: Start difference. First operand 3325 states and 4398 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:09,676 INFO L93 Difference]: Finished difference Result 9925 states and 13143 transitions. [2024-10-12 15:21:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:09,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2024-10-12 15:21:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:09,704 INFO L225 Difference]: With dead ends: 9925 [2024-10-12 15:21:09,704 INFO L226 Difference]: Without dead ends: 6601 [2024-10-12 15:21:09,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:09,713 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 217 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:09,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 166 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6601 states. [2024-10-12 15:21:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6601 to 5767. [2024-10-12 15:21:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5767 states, 5766 states have (on average 1.336801942421089) internal successors, (7708), 5766 states have internal predecessors, (7708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7708 transitions. [2024-10-12 15:21:09,879 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7708 transitions. Word has length 219 [2024-10-12 15:21:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:09,880 INFO L471 AbstractCegarLoop]: Abstraction has 5767 states and 7708 transitions. [2024-10-12 15:21:09,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7708 transitions. [2024-10-12 15:21:09,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-12 15:21:09,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:09,894 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:09,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:21:09,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:09,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:09,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1926779499, now seen corresponding path program 1 times [2024-10-12 15:21:09,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:09,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156212675] [2024-10-12 15:21:09,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:09,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 15:21:10,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156212675] [2024-10-12 15:21:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156212675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:10,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:10,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:10,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807921182] [2024-10-12 15:21:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:10,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:10,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:10,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:10,348 INFO L87 Difference]: Start difference. First operand 5767 states and 7708 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:11,238 INFO L93 Difference]: Finished difference Result 15633 states and 21100 transitions. [2024-10-12 15:21:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:11,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-12 15:21:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:11,274 INFO L225 Difference]: With dead ends: 15633 [2024-10-12 15:21:11,275 INFO L226 Difference]: Without dead ends: 9867 [2024-10-12 15:21:11,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:11,288 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:11,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 186 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2024-10-12 15:21:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9642. [2024-10-12 15:21:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9642 states, 9641 states have (on average 1.356498288559278) internal successors, (13078), 9641 states have internal predecessors, (13078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9642 states to 9642 states and 13078 transitions. [2024-10-12 15:21:11,470 INFO L78 Accepts]: Start accepts. Automaton has 9642 states and 13078 transitions. Word has length 236 [2024-10-12 15:21:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:11,470 INFO L471 AbstractCegarLoop]: Abstraction has 9642 states and 13078 transitions. [2024-10-12 15:21:11,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 9642 states and 13078 transitions. [2024-10-12 15:21:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-12 15:21:11,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:11,487 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:11,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:21:11,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:11,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2074084197, now seen corresponding path program 1 times [2024-10-12 15:21:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367984599] [2024-10-12 15:21:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 15:21:11,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:11,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367984599] [2024-10-12 15:21:11,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367984599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:11,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:11,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578597700] [2024-10-12 15:21:11,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:11,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:11,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:11,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:11,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:11,949 INFO L87 Difference]: Start difference. First operand 9642 states and 13078 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:12,859 INFO L93 Difference]: Finished difference Result 22543 states and 30609 transitions. [2024-10-12 15:21:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:12,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2024-10-12 15:21:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:12,907 INFO L225 Difference]: With dead ends: 22543 [2024-10-12 15:21:12,908 INFO L226 Difference]: Without dead ends: 12902 [2024-10-12 15:21:12,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:12,924 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 204 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:12,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 171 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2024-10-12 15:21:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 12890. [2024-10-12 15:21:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12890 states, 12889 states have (on average 1.332454030568702) internal successors, (17174), 12889 states have internal predecessors, (17174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12890 states to 12890 states and 17174 transitions. [2024-10-12 15:21:13,256 INFO L78 Accepts]: Start accepts. Automaton has 12890 states and 17174 transitions. Word has length 238 [2024-10-12 15:21:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:13,257 INFO L471 AbstractCegarLoop]: Abstraction has 12890 states and 17174 transitions. [2024-10-12 15:21:13,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 12890 states and 17174 transitions. [2024-10-12 15:21:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-12 15:21:13,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:13,279 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:13,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:21:13,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1785011572, now seen corresponding path program 1 times [2024-10-12 15:21:13,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:13,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671390175] [2024-10-12 15:21:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 15:21:13,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671390175] [2024-10-12 15:21:13,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671390175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:13,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:13,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:13,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181294881] [2024-10-12 15:21:13,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:13,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:13,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:13,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:13,799 INFO L87 Difference]: Start difference. First operand 12890 states and 17174 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:14,762 INFO L93 Difference]: Finished difference Result 28844 states and 38190 transitions. [2024-10-12 15:21:14,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:14,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-10-12 15:21:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:14,798 INFO L225 Difference]: With dead ends: 28844 [2024-10-12 15:21:14,798 INFO L226 Difference]: Without dead ends: 16565 [2024-10-12 15:21:14,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:14,816 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 211 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:14,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 194 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16565 states. [2024-10-12 15:21:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16565 to 16548. [2024-10-12 15:21:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16548 states, 16547 states have (on average 1.312262041457666) internal successors, (21714), 16547 states have internal predecessors, (21714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16548 states to 16548 states and 21714 transitions. [2024-10-12 15:21:15,070 INFO L78 Accepts]: Start accepts. Automaton has 16548 states and 21714 transitions. Word has length 239 [2024-10-12 15:21:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:15,071 INFO L471 AbstractCegarLoop]: Abstraction has 16548 states and 21714 transitions. [2024-10-12 15:21:15,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 16548 states and 21714 transitions. [2024-10-12 15:21:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-12 15:21:15,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:15,142 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:15,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:21:15,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash 125037880, now seen corresponding path program 1 times [2024-10-12 15:21:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074267639] [2024-10-12 15:21:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 15:21:15,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:15,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074267639] [2024-10-12 15:21:15,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074267639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:15,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:15,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:15,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610368798] [2024-10-12 15:21:15,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:15,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:15,430 INFO L87 Difference]: Start difference. First operand 16548 states and 21714 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:16,360 INFO L93 Difference]: Finished difference Result 36963 states and 48381 transitions. [2024-10-12 15:21:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:16,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2024-10-12 15:21:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:16,406 INFO L225 Difference]: With dead ends: 36963 [2024-10-12 15:21:16,406 INFO L226 Difference]: Without dead ends: 21432 [2024-10-12 15:21:16,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:16,426 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:16,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 421 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21432 states. [2024-10-12 15:21:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21432 to 20210. [2024-10-12 15:21:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20210 states, 20209 states have (on average 1.2848730763521203) internal successors, (25966), 20209 states have internal predecessors, (25966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20210 states to 20210 states and 25966 transitions. [2024-10-12 15:21:16,718 INFO L78 Accepts]: Start accepts. Automaton has 20210 states and 25966 transitions. Word has length 241 [2024-10-12 15:21:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:16,718 INFO L471 AbstractCegarLoop]: Abstraction has 20210 states and 25966 transitions. [2024-10-12 15:21:16,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 20210 states and 25966 transitions. [2024-10-12 15:21:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-12 15:21:16,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:16,747 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:16,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:21:16,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:16,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash 253450484, now seen corresponding path program 1 times [2024-10-12 15:21:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:16,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378556392] [2024-10-12 15:21:16,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:16,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 15:21:17,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:17,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378556392] [2024-10-12 15:21:17,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378556392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:17,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253587281] [2024-10-12 15:21:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:17,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:17,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:17,358 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) [2024-10-12 15:21:17,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:21:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:17,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:21:17,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 15:21:17,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:17,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253587281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:17,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:17,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:21:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034741968] [2024-10-12 15:21:17,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:17,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:17,717 INFO L87 Difference]: Start difference. First operand 20210 states and 25966 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:18,647 INFO L93 Difference]: Finished difference Result 51006 states and 65546 transitions. [2024-10-12 15:21:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:18,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2024-10-12 15:21:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:18,705 INFO L225 Difference]: With dead ends: 51006 [2024-10-12 15:21:18,706 INFO L226 Difference]: Without dead ends: 31406 [2024-10-12 15:21:18,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:18,731 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 235 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:18,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 165 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31406 states. [2024-10-12 15:21:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31406 to 29573. [2024-10-12 15:21:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29573 states, 29572 states have (on average 1.2623089408900312) internal successors, (37329), 29572 states have internal predecessors, (37329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29573 states to 29573 states and 37329 transitions. [2024-10-12 15:21:19,171 INFO L78 Accepts]: Start accepts. Automaton has 29573 states and 37329 transitions. Word has length 245 [2024-10-12 15:21:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:19,171 INFO L471 AbstractCegarLoop]: Abstraction has 29573 states and 37329 transitions. [2024-10-12 15:21:19,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 29573 states and 37329 transitions. [2024-10-12 15:21:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-12 15:21:19,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:19,201 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:19,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:21:19,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 15:21:19,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:19,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1392378825, now seen corresponding path program 1 times [2024-10-12 15:21:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405524] [2024-10-12 15:21:19,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:19,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 15:21:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405524] [2024-10-12 15:21:19,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:19,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:19,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201281335] [2024-10-12 15:21:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:19,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:19,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:19,861 INFO L87 Difference]: Start difference. First operand 29573 states and 37329 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:20,667 INFO L93 Difference]: Finished difference Result 64659 states and 81279 transitions. [2024-10-12 15:21:20,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:20,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2024-10-12 15:21:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:20,720 INFO L225 Difference]: With dead ends: 64659 [2024-10-12 15:21:20,720 INFO L226 Difference]: Without dead ends: 36103 [2024-10-12 15:21:20,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:20,753 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:20,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 209 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:21:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36103 states. [2024-10-12 15:21:21,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36103 to 36089. [2024-10-12 15:21:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36089 states, 36088 states have (on average 1.2475615162935048) internal successors, (45022), 36088 states have internal predecessors, (45022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36089 states to 36089 states and 45022 transitions. [2024-10-12 15:21:21,341 INFO L78 Accepts]: Start accepts. Automaton has 36089 states and 45022 transitions. Word has length 247 [2024-10-12 15:21:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:21,342 INFO L471 AbstractCegarLoop]: Abstraction has 36089 states and 45022 transitions. [2024-10-12 15:21:21,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 36089 states and 45022 transitions. [2024-10-12 15:21:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-12 15:21:21,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:21,363 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:21,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:21:21,363 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:21,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1417906296, now seen corresponding path program 2 times [2024-10-12 15:21:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:21,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126364647] [2024-10-12 15:21:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:21,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:21:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126364647] [2024-10-12 15:21:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126364647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:21,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:21,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:21,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540682063] [2024-10-12 15:21:21,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:21,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:21,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:21,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:21,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:21,519 INFO L87 Difference]: Start difference. First operand 36089 states and 45022 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:22,120 INFO L93 Difference]: Finished difference Result 101946 states and 127292 transitions. [2024-10-12 15:21:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:22,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2024-10-12 15:21:22,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:22,211 INFO L225 Difference]: With dead ends: 101946 [2024-10-12 15:21:22,211 INFO L226 Difference]: Without dead ends: 67483 [2024-10-12 15:21:22,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:22,241 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 332 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:22,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 940 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:21:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67483 states. [2024-10-12 15:21:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67483 to 67480. [2024-10-12 15:21:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67480 states, 67479 states have (on average 1.226470457475659) internal successors, (82761), 67479 states have internal predecessors, (82761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67480 states to 67480 states and 82761 transitions. [2024-10-12 15:21:23,443 INFO L78 Accepts]: Start accepts. Automaton has 67480 states and 82761 transitions. Word has length 254 [2024-10-12 15:21:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:23,443 INFO L471 AbstractCegarLoop]: Abstraction has 67480 states and 82761 transitions. [2024-10-12 15:21:23,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 67480 states and 82761 transitions. [2024-10-12 15:21:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-12 15:21:23,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:23,490 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:23,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:21:23,491 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:23,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:23,491 INFO L85 PathProgramCache]: Analyzing trace with hash -427956636, now seen corresponding path program 1 times [2024-10-12 15:21:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389711361] [2024-10-12 15:21:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:23,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 15:21:24,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389711361] [2024-10-12 15:21:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389711361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:24,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:24,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869206161] [2024-10-12 15:21:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:24,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:24,027 INFO L87 Difference]: Start difference. First operand 67480 states and 82761 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:25,348 INFO L93 Difference]: Finished difference Result 159722 states and 199175 transitions. [2024-10-12 15:21:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:25,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2024-10-12 15:21:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:25,510 INFO L225 Difference]: With dead ends: 159722 [2024-10-12 15:21:25,510 INFO L226 Difference]: Without dead ends: 93056 [2024-10-12 15:21:25,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:25,531 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 215 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:25,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 199 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93056 states. [2024-10-12 15:21:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93056 to 93056. [2024-10-12 15:21:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93056 states, 93055 states have (on average 1.1798936113051421) internal successors, (109795), 93055 states have internal predecessors, (109795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93056 states to 93056 states and 109795 transitions. [2024-10-12 15:21:26,984 INFO L78 Accepts]: Start accepts. Automaton has 93056 states and 109795 transitions. Word has length 260 [2024-10-12 15:21:26,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:26,984 INFO L471 AbstractCegarLoop]: Abstraction has 93056 states and 109795 transitions. [2024-10-12 15:21:26,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 93056 states and 109795 transitions. [2024-10-12 15:21:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-12 15:21:27,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:27,024 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:27,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:21:27,025 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:27,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:27,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1691549638, now seen corresponding path program 1 times [2024-10-12 15:21:27,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:27,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246001229] [2024-10-12 15:21:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:27,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-12 15:21:27,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246001229] [2024-10-12 15:21:27,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246001229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:27,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126051736] [2024-10-12 15:21:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:27,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:27,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:27,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:27,566 INFO L87 Difference]: Start difference. First operand 93056 states and 109795 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:28,687 INFO L93 Difference]: Finished difference Result 193868 states and 228711 transitions. [2024-10-12 15:21:28,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:28,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2024-10-12 15:21:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:28,819 INFO L225 Difference]: With dead ends: 193868 [2024-10-12 15:21:28,819 INFO L226 Difference]: Without dead ends: 102235 [2024-10-12 15:21:28,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:28,876 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:28,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 376 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102235 states. [2024-10-12 15:21:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102235 to 88381. [2024-10-12 15:21:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88381 states, 88380 states have (on average 1.1693935279474994) internal successors, (103351), 88380 states have internal predecessors, (103351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88381 states to 88381 states and 103351 transitions. [2024-10-12 15:21:30,453 INFO L78 Accepts]: Start accepts. Automaton has 88381 states and 103351 transitions. Word has length 264 [2024-10-12 15:21:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:30,453 INFO L471 AbstractCegarLoop]: Abstraction has 88381 states and 103351 transitions. [2024-10-12 15:21:30,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 88381 states and 103351 transitions. [2024-10-12 15:21:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-12 15:21:30,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:30,488 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:21:30,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:21:30,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:30,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 417714451, now seen corresponding path program 1 times [2024-10-12 15:21:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986111878] [2024-10-12 15:21:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:30,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986111878] [2024-10-12 15:21:31,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986111878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:31,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:31,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:31,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841315606] [2024-10-12 15:21:31,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:31,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:31,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:31,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:31,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:31,251 INFO L87 Difference]: Start difference. First operand 88381 states and 103351 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:32,394 INFO L93 Difference]: Finished difference Result 179413 states and 209413 transitions. [2024-10-12 15:21:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:32,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2024-10-12 15:21:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:32,503 INFO L225 Difference]: With dead ends: 179413 [2024-10-12 15:21:32,503 INFO L226 Difference]: Without dead ends: 92455 [2024-10-12 15:21:32,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:32,537 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 142 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:32,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 207 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:21:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92455 states. [2024-10-12 15:21:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92455 to 91838. [2024-10-12 15:21:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91838 states, 91837 states have (on average 1.165423522109825) internal successors, (107029), 91837 states have internal predecessors, (107029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91838 states to 91838 states and 107029 transitions. [2024-10-12 15:21:33,858 INFO L78 Accepts]: Start accepts. Automaton has 91838 states and 107029 transitions. Word has length 267 [2024-10-12 15:21:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:33,859 INFO L471 AbstractCegarLoop]: Abstraction has 91838 states and 107029 transitions. [2024-10-12 15:21:33,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 91838 states and 107029 transitions. [2024-10-12 15:21:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-12 15:21:33,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:33,911 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:33,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:21:33,911 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:33,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1733414017, now seen corresponding path program 1 times [2024-10-12 15:21:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:33,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252761169] [2024-10-12 15:21:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 15:21:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252761169] [2024-10-12 15:21:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252761169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:34,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651780047] [2024-10-12 15:21:34,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:34,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:21:34,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:34,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:21:34,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:21:34,701 INFO L87 Difference]: Start difference. First operand 91838 states and 107029 transitions. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:36,036 INFO L93 Difference]: Finished difference Result 179269 states and 209285 transitions. [2024-10-12 15:21:36,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:21:36,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2024-10-12 15:21:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:36,164 INFO L225 Difference]: With dead ends: 179269 [2024-10-12 15:21:36,164 INFO L226 Difference]: Without dead ends: 92311 [2024-10-12 15:21:36,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:21:36,228 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 409 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:36,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 162 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:21:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92311 states. [2024-10-12 15:21:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92311 to 89402. [2024-10-12 15:21:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89402 states, 89401 states have (on average 1.1668437713224684) internal successors, (104317), 89401 states have internal predecessors, (104317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89402 states to 89402 states and 104317 transitions. [2024-10-12 15:21:37,730 INFO L78 Accepts]: Start accepts. Automaton has 89402 states and 104317 transitions. Word has length 280 [2024-10-12 15:21:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:37,731 INFO L471 AbstractCegarLoop]: Abstraction has 89402 states and 104317 transitions. [2024-10-12 15:21:37,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 89402 states and 104317 transitions. [2024-10-12 15:21:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-10-12 15:21:37,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:37,770 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:37,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 15:21:37,770 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:37,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1807492686, now seen corresponding path program 1 times [2024-10-12 15:21:37,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:37,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130554208] [2024-10-12 15:21:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-12 15:21:38,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:38,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130554208] [2024-10-12 15:21:38,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130554208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:38,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891269009] [2024-10-12 15:21:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:38,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:38,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:38,036 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) [2024-10-12 15:21:38,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:21:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:38,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:21:38,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 15:21:38,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:38,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891269009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:38,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:38,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:21:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381652092] [2024-10-12 15:21:38,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:38,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:38,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:38,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:38,284 INFO L87 Difference]: Start difference. First operand 89402 states and 104317 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:39,648 INFO L93 Difference]: Finished difference Result 172764 states and 200980 transitions. [2024-10-12 15:21:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2024-10-12 15:21:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:39,761 INFO L225 Difference]: With dead ends: 172764 [2024-10-12 15:21:39,761 INFO L226 Difference]: Without dead ends: 84987 [2024-10-12 15:21:39,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:39,827 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:39,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 390 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:21:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84987 states. [2024-10-12 15:21:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84987 to 84936. [2024-10-12 15:21:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84936 states, 84935 states have (on average 1.1502913993053512) internal successors, (97700), 84935 states have internal predecessors, (97700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84936 states to 84936 states and 97700 transitions. [2024-10-12 15:21:41,149 INFO L78 Accepts]: Start accepts. Automaton has 84936 states and 97700 transitions. Word has length 287 [2024-10-12 15:21:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:41,149 INFO L471 AbstractCegarLoop]: Abstraction has 84936 states and 97700 transitions. [2024-10-12 15:21:41,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 84936 states and 97700 transitions. [2024-10-12 15:21:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-10-12 15:21:41,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:41,191 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:21:41,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:21:41,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 15:21:41,392 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:41,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:41,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2128089610, now seen corresponding path program 1 times [2024-10-12 15:21:41,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:41,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039070853] [2024-10-12 15:21:41,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:41,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-12 15:21:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039070853] [2024-10-12 15:21:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039070853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:42,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426134573] [2024-10-12 15:21:42,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:42,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:42,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:42,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:42,192 INFO L87 Difference]: Start difference. First operand 84936 states and 97700 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:43,275 INFO L93 Difference]: Finished difference Result 207757 states and 239502 transitions. [2024-10-12 15:21:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:43,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 301 [2024-10-12 15:21:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:43,432 INFO L225 Difference]: With dead ends: 207757 [2024-10-12 15:21:43,433 INFO L226 Difference]: Without dead ends: 127498 [2024-10-12 15:21:43,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:43,500 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 243 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:43,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 221 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:21:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127498 states. [2024-10-12 15:21:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127498 to 126863. [2024-10-12 15:21:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126863 states, 126862 states have (on average 1.1493591461588182) internal successors, (145810), 126862 states have internal predecessors, (145810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126863 states to 126863 states and 145810 transitions. [2024-10-12 15:21:45,584 INFO L78 Accepts]: Start accepts. Automaton has 126863 states and 145810 transitions. Word has length 301 [2024-10-12 15:21:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:45,584 INFO L471 AbstractCegarLoop]: Abstraction has 126863 states and 145810 transitions. [2024-10-12 15:21:45,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 126863 states and 145810 transitions. [2024-10-12 15:21:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-10-12 15:21:45,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:45,655 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:21:45,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 15:21:45,655 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:45,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:45,656 INFO L85 PathProgramCache]: Analyzing trace with hash 303033580, now seen corresponding path program 1 times [2024-10-12 15:21:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:45,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440783375] [2024-10-12 15:21:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-12 15:21:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440783375] [2024-10-12 15:21:45,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440783375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:45,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:45,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:45,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039617641] [2024-10-12 15:21:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:45,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:21:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:21:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:21:45,993 INFO L87 Difference]: Start difference. First operand 126863 states and 145810 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:47,636 INFO L93 Difference]: Finished difference Result 209258 states and 240995 transitions. [2024-10-12 15:21:47,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:21:47,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 306 [2024-10-12 15:21:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:47,774 INFO L225 Difference]: With dead ends: 209258 [2024-10-12 15:21:47,774 INFO L226 Difference]: Without dead ends: 79760 [2024-10-12 15:21:47,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:21:47,837 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 560 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:47,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 58 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79760 states. [2024-10-12 15:21:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79760 to 73263. [2024-10-12 15:21:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73263 states, 73262 states have (on average 1.0922442739755944) internal successors, (80020), 73262 states have internal predecessors, (80020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73263 states to 73263 states and 80020 transitions. [2024-10-12 15:21:49,067 INFO L78 Accepts]: Start accepts. Automaton has 73263 states and 80020 transitions. Word has length 306 [2024-10-12 15:21:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:49,067 INFO L471 AbstractCegarLoop]: Abstraction has 73263 states and 80020 transitions. [2024-10-12 15:21:49,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 73263 states and 80020 transitions. [2024-10-12 15:21:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-12 15:21:49,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:49,099 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:21:49,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 15:21:49,099 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:49,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:49,100 INFO L85 PathProgramCache]: Analyzing trace with hash -258926365, now seen corresponding path program 1 times [2024-10-12 15:21:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:49,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690927795] [2024-10-12 15:21:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 140 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690927795] [2024-10-12 15:21:50,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690927795] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027745284] [2024-10-12 15:21:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:50,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:50,033 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) [2024-10-12 15:21:50,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:21:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:50,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:21:50,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:50,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027745284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 15:21:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760591136] [2024-10-12 15:21:50,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:50,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:50,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:50,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:21:50,400 INFO L87 Difference]: Start difference. First operand 73263 states and 80020 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:51,108 INFO L93 Difference]: Finished difference Result 143268 states and 156623 transitions. [2024-10-12 15:21:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2024-10-12 15:21:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:51,196 INFO L225 Difference]: With dead ends: 143268 [2024-10-12 15:21:51,197 INFO L226 Difference]: Without dead ends: 71836 [2024-10-12 15:21:51,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:21:51,242 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 71 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:51,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 270 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:21:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71836 states. [2024-10-12 15:21:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71836 to 71831. [2024-10-12 15:21:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71831 states, 71830 states have (on average 1.0884170959209245) internal successors, (78181), 71830 states have internal predecessors, (78181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71831 states to 71831 states and 78181 transitions. [2024-10-12 15:21:52,436 INFO L78 Accepts]: Start accepts. Automaton has 71831 states and 78181 transitions. Word has length 340 [2024-10-12 15:21:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:52,437 INFO L471 AbstractCegarLoop]: Abstraction has 71831 states and 78181 transitions. [2024-10-12 15:21:52,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 71831 states and 78181 transitions. [2024-10-12 15:21:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-12 15:21:52,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:52,481 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:21:52,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:21:52,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:52,682 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:52,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:52,683 INFO L85 PathProgramCache]: Analyzing trace with hash 959782636, now seen corresponding path program 1 times [2024-10-12 15:21:52,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:52,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793222138] [2024-10-12 15:21:52,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:52,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 15:21:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793222138] [2024-10-12 15:21:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793222138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:53,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:53,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:53,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049085509] [2024-10-12 15:21:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:53,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:53,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:53,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:53,236 INFO L87 Difference]: Start difference. First operand 71831 states and 78181 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:53,878 INFO L93 Difference]: Finished difference Result 187815 states and 203940 transitions. [2024-10-12 15:21:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:53,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2024-10-12 15:21:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:54,020 INFO L225 Difference]: With dead ends: 187815 [2024-10-12 15:21:54,020 INFO L226 Difference]: Without dead ends: 117815 [2024-10-12 15:21:54,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:54,078 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 178 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:54,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 472 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:21:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117815 states. [2024-10-12 15:21:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117815 to 114338. [2024-10-12 15:21:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114338 states, 114337 states have (on average 1.083883607231255) internal successors, (123928), 114337 states have internal predecessors, (123928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114338 states to 114338 states and 123928 transitions. [2024-10-12 15:21:55,625 INFO L78 Accepts]: Start accepts. Automaton has 114338 states and 123928 transitions. Word has length 342 [2024-10-12 15:21:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:55,626 INFO L471 AbstractCegarLoop]: Abstraction has 114338 states and 123928 transitions. [2024-10-12 15:21:55,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 114338 states and 123928 transitions. [2024-10-12 15:21:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-12 15:21:55,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:55,664 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:21:55,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 15:21:55,664 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1799202267, now seen corresponding path program 1 times [2024-10-12 15:21:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838598006] [2024-10-12 15:21:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-12 15:21:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838598006] [2024-10-12 15:21:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838598006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766694316] [2024-10-12 15:21:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:56,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:56,345 INFO L87 Difference]: Start difference. First operand 114338 states and 123928 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:57,258 INFO L93 Difference]: Finished difference Result 208526 states and 225897 transitions. [2024-10-12 15:21:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:57,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2024-10-12 15:21:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:57,366 INFO L225 Difference]: With dead ends: 208526 [2024-10-12 15:21:57,366 INFO L226 Difference]: Without dead ends: 95610 [2024-10-12 15:21:57,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:57,427 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 192 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:57,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 304 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:21:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95610 states. [2024-10-12 15:21:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95610 to 92144. [2024-10-12 15:21:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92144 states, 92143 states have (on average 1.072061903779994) internal successors, (98783), 92143 states have internal predecessors, (98783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92144 states to 92144 states and 98783 transitions. [2024-10-12 15:21:58,929 INFO L78 Accepts]: Start accepts. Automaton has 92144 states and 98783 transitions. Word has length 358 [2024-10-12 15:21:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:58,929 INFO L471 AbstractCegarLoop]: Abstraction has 92144 states and 98783 transitions. [2024-10-12 15:21:58,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 92144 states and 98783 transitions. [2024-10-12 15:21:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-12 15:21:58,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:58,953 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:21:58,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 15:21:58,954 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:58,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash -482414926, now seen corresponding path program 1 times [2024-10-12 15:21:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187852226] [2024-10-12 15:21:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:58,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 15:21:59,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:59,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187852226] [2024-10-12 15:21:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187852226] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:59,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641449169] [2024-10-12 15:21:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:59,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:59,785 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) [2024-10-12 15:21:59,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:21:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:59,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:21:59,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 15:21:59,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:59,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641449169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:59,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:59,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:21:59,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288559892] [2024-10-12 15:21:59,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:59,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:59,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:59,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:21:59,993 INFO L87 Difference]: Start difference. First operand 92144 states and 98783 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:22:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:22:00,839 INFO L93 Difference]: Finished difference Result 177385 states and 190086 transitions. [2024-10-12 15:22:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:22:00,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 365 [2024-10-12 15:22:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:22:01,262 INFO L225 Difference]: With dead ends: 177385 [2024-10-12 15:22:01,262 INFO L226 Difference]: Without dead ends: 86866 [2024-10-12 15:22:01,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:22:01,301 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 212 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:22:01,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 326 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:22:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86866 states. [2024-10-12 15:22:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86866 to 83592. [2024-10-12 15:22:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83592 states, 83591 states have (on average 1.0634039549712289) internal successors, (88891), 83591 states have internal predecessors, (88891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:22:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83592 states to 83592 states and 88891 transitions. [2024-10-12 15:22:02,556 INFO L78 Accepts]: Start accepts. Automaton has 83592 states and 88891 transitions. Word has length 365 [2024-10-12 15:22:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:22:02,556 INFO L471 AbstractCegarLoop]: Abstraction has 83592 states and 88891 transitions. [2024-10-12 15:22:02,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:22:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 83592 states and 88891 transitions. [2024-10-12 15:22:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-10-12 15:22:02,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:22:02,593 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:22:02,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 15:22:02,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:22:02,795 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:22:02,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:22:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1154959175, now seen corresponding path program 1 times [2024-10-12 15:22:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:22:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150789701] [2024-10-12 15:22:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:22:02,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:22:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:22:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-12 15:22:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:22:03,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150789701] [2024-10-12 15:22:03,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150789701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:22:03,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:22:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:22:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190262423] [2024-10-12 15:22:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:22:03,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:22:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:22:03,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:22:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:22:03,005 INFO L87 Difference]: Start difference. First operand 83592 states and 88891 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:22:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:22:03,703 INFO L93 Difference]: Finished difference Result 157023 states and 166876 transitions. [2024-10-12 15:22:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:22:03,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 386 [2024-10-12 15:22:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:22:03,786 INFO L225 Difference]: With dead ends: 157023 [2024-10-12 15:22:03,787 INFO L226 Difference]: Without dead ends: 66530 [2024-10-12 15:22:03,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:22:03,831 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 210 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:22:03,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 293 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:22:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66530 states. [2024-10-12 15:22:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66530 to 54746. [2024-10-12 15:22:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54746 states, 54745 states have (on average 1.049666636222486) internal successors, (57464), 54745 states have internal predecessors, (57464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:22:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54746 states to 54746 states and 57464 transitions. [2024-10-12 15:22:04,864 INFO L78 Accepts]: Start accepts. Automaton has 54746 states and 57464 transitions. Word has length 386 [2024-10-12 15:22:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:22:04,865 INFO L471 AbstractCegarLoop]: Abstraction has 54746 states and 57464 transitions. [2024-10-12 15:22:04,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:22:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 54746 states and 57464 transitions. [2024-10-12 15:22:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-10-12 15:22:04,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:22:04,895 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:22:04,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 15:22:04,895 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:22:04,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:22:04,895 INFO L85 PathProgramCache]: Analyzing trace with hash 241707579, now seen corresponding path program 1 times [2024-10-12 15:22:04,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:22:04,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654335485] [2024-10-12 15:22:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:22:04,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:22:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:22:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-12 15:22:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:22:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654335485] [2024-10-12 15:22:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654335485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:22:05,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:22:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:22:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552053448] [2024-10-12 15:22:05,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:22:05,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:22:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:22:05,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:22:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:22:05,318 INFO L87 Difference]: Start difference. First operand 54746 states and 57464 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 2 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)