./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.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 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:20:10,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:20:10,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:20:10,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:20:10,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:20:10,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:20:10,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:20:10,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:20:10,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:20:10,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:20:10,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:20:10,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:20:10,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:20:10,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:20:10,609 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:20:10,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:20:10,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:20:10,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:20:10,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:20:10,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:20:10,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:20:10,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:20:10,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:20:10,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:20:10,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:20:10,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:20:10,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:20:10,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:20:10,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:20:10,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:20:10,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:20:10,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:20:10,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:20:10,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:20:10,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:20:10,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:20:10,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:20:10,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:20:10,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:20:10,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:20:10,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:20:10,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:20:10,623 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 -> 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 [2024-11-11 21:20:10,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:20:10,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:20:10,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:20:10,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:20:10,921 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:20:10,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-11 21:20:12,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:20:12,705 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:20:12,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-11 21:20:12,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5149b968/1c1d4df597a44d0b96245fc5546d1c6d/FLAG2cde97d77 [2024-11-11 21:20:12,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5149b968/1c1d4df597a44d0b96245fc5546d1c6d [2024-11-11 21:20:12,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:20:12,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:20:12,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:20:12,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:20:12,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:20:12,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:20:12" (1/1) ... [2024-11-11 21:20:12,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302cd5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:12, skipping insertion in model container [2024-11-11 21:20:12,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:20:12" (1/1) ... [2024-11-11 21:20:12,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:20:13,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-11 21:20:13,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:20:13,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:20:13,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-11 21:20:13,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:20:13,192 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:20:13,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13 WrapperNode [2024-11-11 21:20:13,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:20:13,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:20:13,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:20:13,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:20:13,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,261 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 496 [2024-11-11 21:20:13,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:20:13,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:20:13,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:20:13,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:20:13,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,303 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-11-11 21:20:13,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:20:13,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:20:13,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:20:13,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:20:13,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (1/1) ... [2024-11-11 21:20:13,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:20:13,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:20:13,442 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-11-11 21:20:13,458 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-11-11 21:20:13,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:20:13,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:20:13,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:20:13,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:20:13,606 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:20:13,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:20:14,209 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-11 21:20:14,210 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:20:14,228 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:20:14,228 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:20:14,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:20:14 BoogieIcfgContainer [2024-11-11 21:20:14,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:20:14,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:20:14,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:20:14,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:20:14,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:20:12" (1/3) ... [2024-11-11 21:20:14,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b178f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:20:14, skipping insertion in model container [2024-11-11 21:20:14,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:20:13" (2/3) ... [2024-11-11 21:20:14,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b178f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:20:14, skipping insertion in model container [2024-11-11 21:20:14,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:20:14" (3/3) ... [2024-11-11 21:20:14,237 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-11 21:20:14,252 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:20:14,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:20:14,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:20:14,325 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;@6d6977a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:20:14,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:20:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.7829457364341086) internal successors, (230), 130 states have internal predecessors, (230), 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-11-11 21:20:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 21:20:14,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:14,341 INFO L218 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] [2024-11-11 21:20:14,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:14,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash -210556357, now seen corresponding path program 1 times [2024-11-11 21:20:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:14,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166626944] [2024-11-11 21:20:14,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:14,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:14,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166626944] [2024-11-11 21:20:14,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166626944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:14,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:14,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:20:14,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246384054] [2024-11-11 21:20:14,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:14,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:20:14,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:14,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:20:14,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:20:14,821 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.7829457364341086) internal successors, (230), 130 states have internal predecessors, (230), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-11-11 21:20:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:14,851 INFO L93 Difference]: Finished difference Result 203 states and 352 transitions. [2024-11-11 21:20:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:20:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2024-11-11 21:20:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:14,865 INFO L225 Difference]: With dead ends: 203 [2024-11-11 21:20:14,865 INFO L226 Difference]: Without dead ends: 127 [2024-11-11 21:20:14,868 INFO L434 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-11-11 21:20:14,873 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:14,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-11 21:20:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-11 21:20:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.7698412698412698) internal successors, (223), 126 states have internal predecessors, (223), 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-11-11 21:20:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 223 transitions. [2024-11-11 21:20:14,921 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 223 transitions. Word has length 37 [2024-11-11 21:20:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:14,925 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 223 transitions. [2024-11-11 21:20:14,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-11-11 21:20:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 223 transitions. [2024-11-11 21:20:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 21:20:14,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:14,927 INFO L218 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] [2024-11-11 21:20:14,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:20:14,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:14,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1028204807, now seen corresponding path program 1 times [2024-11-11 21:20:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:14,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028935892] [2024-11-11 21:20:14,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:15,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028935892] [2024-11-11 21:20:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028935892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:20:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116771244] [2024-11-11 21:20:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:15,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:20:15,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:15,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:20:15,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:15,293 INFO L87 Difference]: Start difference. First operand 127 states and 223 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11-11 21:20:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:15,380 INFO L93 Difference]: Finished difference Result 198 states and 342 transitions. [2024-11-11 21:20:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:20:15,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-11 21:20:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:15,382 INFO L225 Difference]: With dead ends: 198 [2024-11-11 21:20:15,382 INFO L226 Difference]: Without dead ends: 127 [2024-11-11 21:20:15,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-11 21:20:15,384 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:15,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 849 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-11 21:20:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-11 21:20:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 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-11-11 21:20:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2024-11-11 21:20:15,394 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37 [2024-11-11 21:20:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:15,394 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2024-11-11 21:20:15,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11-11 21:20:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2024-11-11 21:20:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:20:15,397 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:15,397 INFO L218 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] [2024-11-11 21:20:15,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:20:15,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:15,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:15,398 INFO L85 PathProgramCache]: Analyzing trace with hash 792730303, now seen corresponding path program 1 times [2024-11-11 21:20:15,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735702661] [2024-11-11 21:20:15,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735702661] [2024-11-11 21:20:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735702661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:15,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:15,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643240945] [2024-11-11 21:20:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:15,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:15,580 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-11 21:20:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:15,642 INFO L93 Difference]: Finished difference Result 247 states and 397 transitions. [2024-11-11 21:20:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2024-11-11 21:20:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:15,645 INFO L225 Difference]: With dead ends: 247 [2024-11-11 21:20:15,649 INFO L226 Difference]: Without dead ends: 180 [2024-11-11 21:20:15,649 INFO L434 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-11-11 21:20:15,650 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 89 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:15,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 330 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-11 21:20:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-11-11 21:20:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 177 states have internal predecessors, (276), 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-11-11 21:20:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 276 transitions. [2024-11-11 21:20:15,665 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 276 transitions. Word has length 66 [2024-11-11 21:20:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:15,666 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 276 transitions. [2024-11-11 21:20:15,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-11 21:20:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 276 transitions. [2024-11-11 21:20:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 21:20:15,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:15,668 INFO L218 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] [2024-11-11 21:20:15,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:20:15,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:15,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1252750669, now seen corresponding path program 1 times [2024-11-11 21:20:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192364826] [2024-11-11 21:20:15,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:15,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:15,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192364826] [2024-11-11 21:20:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192364826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:15,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:15,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:15,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357588448] [2024-11-11 21:20:15,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:15,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:15,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:15,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:15,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:15,786 INFO L87 Difference]: Start difference. First operand 178 states and 276 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-11-11 21:20:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:15,825 INFO L93 Difference]: Finished difference Result 398 states and 644 transitions. [2024-11-11 21:20:15,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:15,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 68 [2024-11-11 21:20:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:15,829 INFO L225 Difference]: With dead ends: 398 [2024-11-11 21:20:15,829 INFO L226 Difference]: Without dead ends: 280 [2024-11-11 21:20:15,830 INFO L434 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-11-11 21:20:15,831 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 91 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:15,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 350 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-11 21:20:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2024-11-11 21:20:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.5992779783393503) internal successors, (443), 277 states have internal predecessors, (443), 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-11-11 21:20:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 443 transitions. [2024-11-11 21:20:15,856 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 443 transitions. Word has length 68 [2024-11-11 21:20:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 443 transitions. [2024-11-11 21:20:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-11-11 21:20:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 443 transitions. [2024-11-11 21:20:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 21:20:15,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:15,859 INFO L218 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] [2024-11-11 21:20:15,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:20:15,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:15,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1185859003, now seen corresponding path program 1 times [2024-11-11 21:20:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211496782] [2024-11-11 21:20:15,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:16,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211496782] [2024-11-11 21:20:16,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211496782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:16,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125620407] [2024-11-11 21:20:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:16,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:16,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:16,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:16,022 INFO L87 Difference]: Start difference. First operand 278 states and 443 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-11-11 21:20:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:16,052 INFO L93 Difference]: Finished difference Result 682 states and 1117 transitions. [2024-11-11 21:20:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:16,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2024-11-11 21:20:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:16,056 INFO L225 Difference]: With dead ends: 682 [2024-11-11 21:20:16,056 INFO L226 Difference]: Without dead ends: 464 [2024-11-11 21:20:16,058 INFO L434 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-11-11 21:20:16,060 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 85 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:16,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 351 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-11 21:20:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 462. [2024-11-11 21:20:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.6203904555314534) internal successors, (747), 461 states have internal predecessors, (747), 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-11-11 21:20:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 747 transitions. [2024-11-11 21:20:16,094 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 747 transitions. Word has length 70 [2024-11-11 21:20:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:16,095 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 747 transitions. [2024-11-11 21:20:16,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-11-11 21:20:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 747 transitions. [2024-11-11 21:20:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 21:20:16,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:16,098 INFO L218 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] [2024-11-11 21:20:16,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:20:16,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:16,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -565459959, now seen corresponding path program 1 times [2024-11-11 21:20:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706638912] [2024-11-11 21:20:16,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:16,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:16,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706638912] [2024-11-11 21:20:16,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706638912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:16,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:16,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:20:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431594761] [2024-11-11 21:20:16,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:16,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:20:16,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:16,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:20:16,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:16,309 INFO L87 Difference]: Start difference. First operand 462 states and 747 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-11-11 21:20:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:16,526 INFO L93 Difference]: Finished difference Result 2290 states and 3809 transitions. [2024-11-11 21:20:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:20:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2024-11-11 21:20:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:16,538 INFO L225 Difference]: With dead ends: 2290 [2024-11-11 21:20:16,539 INFO L226 Difference]: Without dead ends: 1888 [2024-11-11 21:20:16,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:20:16,542 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 667 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:16,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1153 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2024-11-11 21:20:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 846. [2024-11-11 21:20:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.6366863905325444) internal successors, (1383), 845 states have internal predecessors, (1383), 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-11-11 21:20:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1383 transitions. [2024-11-11 21:20:16,587 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1383 transitions. Word has length 72 [2024-11-11 21:20:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:16,589 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1383 transitions. [2024-11-11 21:20:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-11-11 21:20:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1383 transitions. [2024-11-11 21:20:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 21:20:16,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:16,591 INFO L218 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] [2024-11-11 21:20:16,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:20:16,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:16,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2022745121, now seen corresponding path program 1 times [2024-11-11 21:20:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872351363] [2024-11-11 21:20:16,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:16,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872351363] [2024-11-11 21:20:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872351363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:16,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:16,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:20:16,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327446138] [2024-11-11 21:20:16,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:16,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:20:16,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:16,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:20:16,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:20:16,722 INFO L87 Difference]: Start difference. First operand 846 states and 1383 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-11-11 21:20:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:16,844 INFO L93 Difference]: Finished difference Result 3044 states and 5034 transitions. [2024-11-11 21:20:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:20:16,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 73 [2024-11-11 21:20:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:16,853 INFO L225 Difference]: With dead ends: 3044 [2024-11-11 21:20:16,854 INFO L226 Difference]: Without dead ends: 2258 [2024-11-11 21:20:16,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:16,858 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 331 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:16,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 617 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2024-11-11 21:20:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 1543. [2024-11-11 21:20:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1542 states have (on average 1.638780804150454) internal successors, (2527), 1542 states have internal predecessors, (2527), 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-11-11 21:20:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2527 transitions. [2024-11-11 21:20:16,905 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2527 transitions. Word has length 73 [2024-11-11 21:20:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:16,905 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2527 transitions. [2024-11-11 21:20:16,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-11-11 21:20:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2527 transitions. [2024-11-11 21:20:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:20:16,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:16,907 INFO L218 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] [2024-11-11 21:20:16,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:20:16,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:16,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash 482119495, now seen corresponding path program 1 times [2024-11-11 21:20:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400509366] [2024-11-11 21:20:16,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:16,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400509366] [2024-11-11 21:20:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400509366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:17,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:17,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:17,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967696731] [2024-11-11 21:20:17,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:17,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:17,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:17,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:17,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:17,037 INFO L87 Difference]: Start difference. First operand 1543 states and 2527 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-11 21:20:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:17,083 INFO L93 Difference]: Finished difference Result 3037 states and 4986 transitions. [2024-11-11 21:20:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:17,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-11-11 21:20:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:17,092 INFO L225 Difference]: With dead ends: 3037 [2024-11-11 21:20:17,092 INFO L226 Difference]: Without dead ends: 2191 [2024-11-11 21:20:17,094 INFO L434 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-11-11 21:20:17,095 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 92 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:17,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 420 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2024-11-11 21:20:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2189. [2024-11-11 21:20:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 2188 states have (on average 1.6252285191956124) internal successors, (3556), 2188 states have internal predecessors, (3556), 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-11-11 21:20:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3556 transitions. [2024-11-11 21:20:17,150 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3556 transitions. Word has length 74 [2024-11-11 21:20:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:17,151 INFO L471 AbstractCegarLoop]: Abstraction has 2189 states and 3556 transitions. [2024-11-11 21:20:17,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-11 21:20:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3556 transitions. [2024-11-11 21:20:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:20:17,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:17,152 INFO L218 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] [2024-11-11 21:20:17,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:20:17,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:17,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:17,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1535861927, now seen corresponding path program 1 times [2024-11-11 21:20:17,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:17,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570640035] [2024-11-11 21:20:17,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:17,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:17,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:17,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570640035] [2024-11-11 21:20:17,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570640035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:17,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:17,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:17,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207865776] [2024-11-11 21:20:17,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:17,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:17,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:17,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:17,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:17,227 INFO L87 Difference]: Start difference. First operand 2189 states and 3556 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-11 21:20:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:17,302 INFO L93 Difference]: Finished difference Result 4261 states and 6938 transitions. [2024-11-11 21:20:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:17,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-11-11 21:20:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:17,318 INFO L225 Difference]: With dead ends: 4261 [2024-11-11 21:20:17,318 INFO L226 Difference]: Without dead ends: 3073 [2024-11-11 21:20:17,323 INFO L434 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-11-11 21:20:17,324 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 86 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:17,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 409 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2024-11-11 21:20:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3071. [2024-11-11 21:20:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 3070 states have (on average 1.6104234527687296) internal successors, (4944), 3070 states have internal predecessors, (4944), 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-11-11 21:20:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4944 transitions. [2024-11-11 21:20:17,403 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4944 transitions. Word has length 74 [2024-11-11 21:20:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:17,404 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 4944 transitions. [2024-11-11 21:20:17,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-11 21:20:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4944 transitions. [2024-11-11 21:20:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:20:17,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:17,405 INFO L218 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] [2024-11-11 21:20:17,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:20:17,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:17,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:17,406 INFO L85 PathProgramCache]: Analyzing trace with hash 821728320, now seen corresponding path program 1 times [2024-11-11 21:20:17,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:17,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026825909] [2024-11-11 21:20:17,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:17,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026825909] [2024-11-11 21:20:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026825909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:17,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:17,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:20:17,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619576787] [2024-11-11 21:20:17,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:17,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:20:17,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:17,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:20:17,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:20:17,551 INFO L87 Difference]: Start difference. First operand 3071 states and 4944 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-11-11 21:20:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:17,702 INFO L93 Difference]: Finished difference Result 9776 states and 15807 transitions. [2024-11-11 21:20:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:20:17,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 74 [2024-11-11 21:20:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:17,732 INFO L225 Difference]: With dead ends: 9776 [2024-11-11 21:20:17,733 INFO L226 Difference]: Without dead ends: 6823 [2024-11-11 21:20:17,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:17,741 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 330 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:17,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 614 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:17,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2024-11-11 21:20:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 4923. [2024-11-11 21:20:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4923 states, 4922 states have (on average 1.5997561966680212) internal successors, (7874), 4922 states have internal predecessors, (7874), 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-11-11 21:20:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 7874 transitions. [2024-11-11 21:20:17,899 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 7874 transitions. Word has length 74 [2024-11-11 21:20:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:17,900 INFO L471 AbstractCegarLoop]: Abstraction has 4923 states and 7874 transitions. [2024-11-11 21:20:17,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-11-11 21:20:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 7874 transitions. [2024-11-11 21:20:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:20:17,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:17,901 INFO L218 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] [2024-11-11 21:20:17,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:20:17,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:17,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1254834663, now seen corresponding path program 1 times [2024-11-11 21:20:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237151669] [2024-11-11 21:20:17,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237151669] [2024-11-11 21:20:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237151669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:18,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:18,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746360657] [2024-11-11 21:20:18,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:18,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:18,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:18,019 INFO L87 Difference]: Start difference. First operand 4923 states and 7874 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-11 21:20:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:18,149 INFO L93 Difference]: Finished difference Result 11800 states and 18979 transitions. [2024-11-11 21:20:18,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:18,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-11-11 21:20:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:18,191 INFO L225 Difference]: With dead ends: 11800 [2024-11-11 21:20:18,192 INFO L226 Difference]: Without dead ends: 6955 [2024-11-11 21:20:18,203 INFO L434 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-11-11 21:20:18,204 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 98 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:18,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 437 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6955 states. [2024-11-11 21:20:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6955 to 6953. [2024-11-11 21:20:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6953 states, 6952 states have (on average 1.6039988492520139) internal successors, (11151), 6952 states have internal predecessors, (11151), 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-11-11 21:20:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6953 states to 6953 states and 11151 transitions. [2024-11-11 21:20:18,477 INFO L78 Accepts]: Start accepts. Automaton has 6953 states and 11151 transitions. Word has length 74 [2024-11-11 21:20:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:18,477 INFO L471 AbstractCegarLoop]: Abstraction has 6953 states and 11151 transitions. [2024-11-11 21:20:18,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-11 21:20:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 6953 states and 11151 transitions. [2024-11-11 21:20:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 21:20:18,479 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:18,479 INFO L218 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] [2024-11-11 21:20:18,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:20:18,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:18,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1881049800, now seen corresponding path program 1 times [2024-11-11 21:20:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:18,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279172833] [2024-11-11 21:20:18,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:18,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:18,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:18,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279172833] [2024-11-11 21:20:18,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279172833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:18,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:18,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:20:18,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187124251] [2024-11-11 21:20:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:18,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:20:18,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:18,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:20:18,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:20:18,611 INFO L87 Difference]: Start difference. First operand 6953 states and 11151 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-11-11 21:20:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:18,976 INFO L93 Difference]: Finished difference Result 22120 states and 35544 transitions. [2024-11-11 21:20:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:20:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 75 [2024-11-11 21:20:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:19,017 INFO L225 Difference]: With dead ends: 22120 [2024-11-11 21:20:19,017 INFO L226 Difference]: Without dead ends: 15245 [2024-11-11 21:20:19,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:19,031 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 328 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:19,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 616 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15245 states. [2024-11-11 21:20:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15245 to 11046. [2024-11-11 21:20:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11046 states, 11045 states have (on average 1.5905839746491626) internal successors, (17568), 11045 states have internal predecessors, (17568), 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-11-11 21:20:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11046 states to 11046 states and 17568 transitions. [2024-11-11 21:20:19,449 INFO L78 Accepts]: Start accepts. Automaton has 11046 states and 17568 transitions. Word has length 75 [2024-11-11 21:20:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:19,450 INFO L471 AbstractCegarLoop]: Abstraction has 11046 states and 17568 transitions. [2024-11-11 21:20:19,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-11-11 21:20:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 11046 states and 17568 transitions. [2024-11-11 21:20:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:20:19,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:19,451 INFO L218 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] [2024-11-11 21:20:19,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:20:19,452 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:19,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1635147248, now seen corresponding path program 1 times [2024-11-11 21:20:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:19,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339885638] [2024-11-11 21:20:19,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:19,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:19,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339885638] [2024-11-11 21:20:19,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339885638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:19,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:19,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:20:19,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525219419] [2024-11-11 21:20:19,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:19,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:20:19,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:19,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:20:19,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:19,664 INFO L87 Difference]: Start difference. First operand 11046 states and 17568 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-11-11 21:20:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:19,945 INFO L93 Difference]: Finished difference Result 22016 states and 35033 transitions. [2024-11-11 21:20:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:20:19,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-11 21:20:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:19,971 INFO L225 Difference]: With dead ends: 22016 [2024-11-11 21:20:19,972 INFO L226 Difference]: Without dead ends: 11048 [2024-11-11 21:20:19,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:20:19,987 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 171 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:19,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 508 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11048 states. [2024-11-11 21:20:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11048 to 11046. [2024-11-11 21:20:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11046 states, 11045 states have (on average 1.5770031688546853) internal successors, (17418), 11045 states have internal predecessors, (17418), 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-11-11 21:20:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11046 states to 11046 states and 17418 transitions. [2024-11-11 21:20:20,348 INFO L78 Accepts]: Start accepts. Automaton has 11046 states and 17418 transitions. Word has length 77 [2024-11-11 21:20:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:20,349 INFO L471 AbstractCegarLoop]: Abstraction has 11046 states and 17418 transitions. [2024-11-11 21:20:20,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-11-11 21:20:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 11046 states and 17418 transitions. [2024-11-11 21:20:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:20:20,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:20,350 INFO L218 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] [2024-11-11 21:20:20,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:20:20,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:20,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1744604605, now seen corresponding path program 1 times [2024-11-11 21:20:20,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:20,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215524367] [2024-11-11 21:20:20,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:20,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:20,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:20,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215524367] [2024-11-11 21:20:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215524367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:20,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:20:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733401704] [2024-11-11 21:20:20,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:20,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:20:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:20,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:20:20,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:20,576 INFO L87 Difference]: Start difference. First operand 11046 states and 17418 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-11-11 21:20:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:21,113 INFO L93 Difference]: Finished difference Result 31861 states and 50385 transitions. [2024-11-11 21:20:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:20:21,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-11-11 21:20:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:21,169 INFO L225 Difference]: With dead ends: 31861 [2024-11-11 21:20:21,169 INFO L226 Difference]: Without dead ends: 20893 [2024-11-11 21:20:21,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:20:21,188 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 84 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:21,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 678 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20893 states. [2024-11-11 21:20:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20893 to 20891. [2024-11-11 21:20:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20891 states, 20890 states have (on average 1.5632359980852082) internal successors, (32656), 20890 states have internal predecessors, (32656), 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-11-11 21:20:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20891 states to 20891 states and 32656 transitions. [2024-11-11 21:20:21,745 INFO L78 Accepts]: Start accepts. Automaton has 20891 states and 32656 transitions. Word has length 80 [2024-11-11 21:20:21,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:21,745 INFO L471 AbstractCegarLoop]: Abstraction has 20891 states and 32656 transitions. [2024-11-11 21:20:21,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-11-11 21:20:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 20891 states and 32656 transitions. [2024-11-11 21:20:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:20:21,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:21,747 INFO L218 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] [2024-11-11 21:20:21,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:20:21,748 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:21,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1323256441, now seen corresponding path program 1 times [2024-11-11 21:20:21,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:21,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590072153] [2024-11-11 21:20:21,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:22,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:22,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590072153] [2024-11-11 21:20:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590072153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:22,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:22,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:20:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784550355] [2024-11-11 21:20:22,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:22,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:20:22,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:22,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:20:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:20:22,166 INFO L87 Difference]: Start difference. First operand 20891 states and 32656 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-11-11 21:20:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:22,402 INFO L93 Difference]: Finished difference Result 22054 states and 34205 transitions. [2024-11-11 21:20:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:20:22,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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 81 [2024-11-11 21:20:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:22,456 INFO L225 Difference]: With dead ends: 22054 [2024-11-11 21:20:22,457 INFO L226 Difference]: Without dead ends: 22052 [2024-11-11 21:20:22,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:20:22,470 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:22,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1291 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22052 states. [2024-11-11 21:20:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22052 to 22052. [2024-11-11 21:20:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22052 states, 22051 states have (on average 1.5331730987256813) internal successors, (33808), 22051 states have internal predecessors, (33808), 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-11-11 21:20:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22052 states to 22052 states and 33808 transitions. [2024-11-11 21:20:23,180 INFO L78 Accepts]: Start accepts. Automaton has 22052 states and 33808 transitions. Word has length 81 [2024-11-11 21:20:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:23,181 INFO L471 AbstractCegarLoop]: Abstraction has 22052 states and 33808 transitions. [2024-11-11 21:20:23,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-11-11 21:20:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 22052 states and 33808 transitions. [2024-11-11 21:20:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 21:20:23,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:23,184 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:23,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:20:23,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:23,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:23,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1301469614, now seen corresponding path program 1 times [2024-11-11 21:20:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296572339] [2024-11-11 21:20:23,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:23,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:20:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:23,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296572339] [2024-11-11 21:20:23,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296572339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:23,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:23,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:20:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189675764] [2024-11-11 21:20:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:23,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:20:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:20:23,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:23,390 INFO L87 Difference]: Start difference. First operand 22052 states and 33808 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-11-11 21:20:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:24,024 INFO L93 Difference]: Finished difference Result 55228 states and 84835 transitions. [2024-11-11 21:20:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:20:24,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 107 [2024-11-11 21:20:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:24,135 INFO L225 Difference]: With dead ends: 55228 [2024-11-11 21:20:24,135 INFO L226 Difference]: Without dead ends: 45002 [2024-11-11 21:20:24,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:20:24,167 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 415 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:24,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 805 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45002 states. [2024-11-11 21:20:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45002 to 34652. [2024-11-11 21:20:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34652 states, 34651 states have (on average 1.5287581887968602) internal successors, (52973), 34651 states have internal predecessors, (52973), 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-11-11 21:20:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34652 states to 34652 states and 52973 transitions. [2024-11-11 21:20:25,256 INFO L78 Accepts]: Start accepts. Automaton has 34652 states and 52973 transitions. Word has length 107 [2024-11-11 21:20:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:25,256 INFO L471 AbstractCegarLoop]: Abstraction has 34652 states and 52973 transitions. [2024-11-11 21:20:25,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-11-11 21:20:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 34652 states and 52973 transitions. [2024-11-11 21:20:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 21:20:25,259 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:25,259 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:25,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:20:25,259 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:25,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -247727182, now seen corresponding path program 1 times [2024-11-11 21:20:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443570801] [2024-11-11 21:20:25,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 21:20:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443570801] [2024-11-11 21:20:25,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443570801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:25,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:25,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:20:25,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564599272] [2024-11-11 21:20:25,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:25,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:20:25,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:20:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:25,490 INFO L87 Difference]: Start difference. First operand 34652 states and 52973 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-11-11 21:20:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:26,040 INFO L93 Difference]: Finished difference Result 59356 states and 91187 transitions. [2024-11-11 21:20:26,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:20:26,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 107 [2024-11-11 21:20:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:26,155 INFO L225 Difference]: With dead ends: 59356 [2024-11-11 21:20:26,156 INFO L226 Difference]: Without dead ends: 49130 [2024-11-11 21:20:26,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:20:26,195 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 420 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:26,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 859 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49130 states. [2024-11-11 21:20:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49130 to 47052. [2024-11-11 21:20:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47052 states, 47051 states have (on average 1.5290429533910013) internal successors, (71943), 47051 states have internal predecessors, (71943), 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-11-11 21:20:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47052 states to 47052 states and 71943 transitions. [2024-11-11 21:20:27,655 INFO L78 Accepts]: Start accepts. Automaton has 47052 states and 71943 transitions. Word has length 107 [2024-11-11 21:20:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:27,656 INFO L471 AbstractCegarLoop]: Abstraction has 47052 states and 71943 transitions. [2024-11-11 21:20:27,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-11-11 21:20:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 47052 states and 71943 transitions. [2024-11-11 21:20:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 21:20:27,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:27,659 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:27,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:20:27,659 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:27,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash -528754446, now seen corresponding path program 1 times [2024-11-11 21:20:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:27,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708507854] [2024-11-11 21:20:27,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:20:27,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:27,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708507854] [2024-11-11 21:20:27,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708507854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:27,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:27,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:20:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141266556] [2024-11-11 21:20:27,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:27,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:20:27,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:20:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:20:27,832 INFO L87 Difference]: Start difference. First operand 47052 states and 71943 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-11-11 21:20:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:28,770 INFO L93 Difference]: Finished difference Result 70034 states and 107626 transitions. [2024-11-11 21:20:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:20:28,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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 107 [2024-11-11 21:20:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:28,897 INFO L225 Difference]: With dead ends: 70034 [2024-11-11 21:20:28,897 INFO L226 Difference]: Without dead ends: 57322 [2024-11-11 21:20:29,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:20:29,069 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 412 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:29,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 882 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57322 states. [2024-11-11 21:20:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57322 to 55244. [2024-11-11 21:20:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55244 states, 55243 states have (on average 1.5307097731839328) internal successors, (84561), 55243 states have internal predecessors, (84561), 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-11-11 21:20:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55244 states to 55244 states and 84561 transitions. [2024-11-11 21:20:30,357 INFO L78 Accepts]: Start accepts. Automaton has 55244 states and 84561 transitions. Word has length 107 [2024-11-11 21:20:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:30,358 INFO L471 AbstractCegarLoop]: Abstraction has 55244 states and 84561 transitions. [2024-11-11 21:20:30,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-11-11 21:20:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 55244 states and 84561 transitions. [2024-11-11 21:20:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 21:20:30,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:30,361 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:30,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:20:30,361 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:30,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1134351272, now seen corresponding path program 1 times [2024-11-11 21:20:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:30,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73066801] [2024-11-11 21:20:30,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:20:30,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73066801] [2024-11-11 21:20:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73066801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:30,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:30,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:20:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948312226] [2024-11-11 21:20:30,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:20:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:30,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:20:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:20:30,504 INFO L87 Difference]: Start difference. First operand 55244 states and 84561 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-11 21:20:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:31,541 INFO L93 Difference]: Finished difference Result 94923 states and 145879 transitions. [2024-11-11 21:20:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:20:31,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 108 [2024-11-11 21:20:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:31,702 INFO L225 Difference]: With dead ends: 94923 [2024-11-11 21:20:31,703 INFO L226 Difference]: Without dead ends: 74019 [2024-11-11 21:20:31,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-11 21:20:31,733 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 171 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:31,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 643 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:20:31,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74019 states. [2024-11-11 21:20:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74019 to 71943. [2024-11-11 21:20:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71943 states, 71942 states have (on average 1.528411776153012) internal successors, (109957), 71942 states have internal predecessors, (109957), 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-11-11 21:20:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71943 states to 71943 states and 109957 transitions. [2024-11-11 21:20:33,328 INFO L78 Accepts]: Start accepts. Automaton has 71943 states and 109957 transitions. Word has length 108 [2024-11-11 21:20:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:33,329 INFO L471 AbstractCegarLoop]: Abstraction has 71943 states and 109957 transitions. [2024-11-11 21:20:33,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-11 21:20:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 71943 states and 109957 transitions. [2024-11-11 21:20:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 21:20:33,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:33,331 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:20:33,332 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:33,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash -711649446, now seen corresponding path program 1 times [2024-11-11 21:20:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885298179] [2024-11-11 21:20:33,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:20:33,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:33,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885298179] [2024-11-11 21:20:33,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885298179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:33,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:33,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997453994] [2024-11-11 21:20:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:33,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:33,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:33,412 INFO L87 Difference]: Start difference. First operand 71943 states and 109957 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-11 21:20:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:35,282 INFO L93 Difference]: Finished difference Result 164712 states and 252064 transitions. [2024-11-11 21:20:35,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:35,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 108 [2024-11-11 21:20:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:35,617 INFO L225 Difference]: With dead ends: 164712 [2024-11-11 21:20:35,617 INFO L226 Difference]: Without dead ends: 127064 [2024-11-11 21:20:35,668 INFO L434 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-11-11 21:20:35,669 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 74 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:35,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 350 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127064 states. [2024-11-11 21:20:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127064 to 126786. [2024-11-11 21:20:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126786 states, 126785 states have (on average 1.5255984540757976) internal successors, (193423), 126785 states have internal predecessors, (193423), 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-11-11 21:20:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126786 states to 126786 states and 193423 transitions. [2024-11-11 21:20:38,509 INFO L78 Accepts]: Start accepts. Automaton has 126786 states and 193423 transitions. Word has length 108 [2024-11-11 21:20:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:38,509 INFO L471 AbstractCegarLoop]: Abstraction has 126786 states and 193423 transitions. [2024-11-11 21:20:38,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-11 21:20:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 126786 states and 193423 transitions. [2024-11-11 21:20:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 21:20:38,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:38,512 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:38,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:20:38,512 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:38,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:38,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1394779984, now seen corresponding path program 1 times [2024-11-11 21:20:38,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:38,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420508081] [2024-11-11 21:20:38,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:38,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:38,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:38,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420508081] [2024-11-11 21:20:38,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420508081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:38,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:38,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:38,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019668225] [2024-11-11 21:20:38,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:38,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:38,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:38,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:38,672 INFO L87 Difference]: Start difference. First operand 126786 states and 193423 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:20:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:40,833 INFO L93 Difference]: Finished difference Result 252504 states and 385751 transitions. [2024-11-11 21:20:40,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:40,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-11 21:20:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:41,087 INFO L225 Difference]: With dead ends: 252504 [2024-11-11 21:20:41,087 INFO L226 Difference]: Without dead ends: 125796 [2024-11-11 21:20:41,177 INFO L434 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-11-11 21:20:41,178 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 74 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:41,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 412 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125796 states. [2024-11-11 21:20:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125796 to 119053. [2024-11-11 21:20:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119053 states, 119052 states have (on average 1.5350435103988174) internal successors, (182750), 119052 states have internal predecessors, (182750), 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-11-11 21:20:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119053 states to 119053 states and 182750 transitions. [2024-11-11 21:20:43,502 INFO L78 Accepts]: Start accepts. Automaton has 119053 states and 182750 transitions. Word has length 109 [2024-11-11 21:20:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:43,502 INFO L471 AbstractCegarLoop]: Abstraction has 119053 states and 182750 transitions. [2024-11-11 21:20:43,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:20:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 119053 states and 182750 transitions. [2024-11-11 21:20:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 21:20:43,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:43,505 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:43,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:20:43,506 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:43,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash 313571736, now seen corresponding path program 1 times [2024-11-11 21:20:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:43,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331190730] [2024-11-11 21:20:43,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:43,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:43,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331190730] [2024-11-11 21:20:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331190730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:43,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:43,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:43,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75987721] [2024-11-11 21:20:43,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:43,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:43,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:43,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:43,577 INFO L87 Difference]: Start difference. First operand 119053 states and 182750 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:20:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:46,892 INFO L93 Difference]: Finished difference Result 354366 states and 542720 transitions. [2024-11-11 21:20:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:46,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-11 21:20:46,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:47,406 INFO L225 Difference]: With dead ends: 354366 [2024-11-11 21:20:47,407 INFO L226 Difference]: Without dead ends: 235391 [2024-11-11 21:20:47,477 INFO L434 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-11-11 21:20:47,480 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 144 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:47,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 460 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235391 states. [2024-11-11 21:20:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235391 to 235389. [2024-11-11 21:20:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235389 states, 235388 states have (on average 1.5182209798290482) internal successors, (357371), 235388 states have internal predecessors, (357371), 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-11-11 21:20:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235389 states to 235389 states and 357371 transitions. [2024-11-11 21:20:52,985 INFO L78 Accepts]: Start accepts. Automaton has 235389 states and 357371 transitions. Word has length 109 [2024-11-11 21:20:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:52,986 INFO L471 AbstractCegarLoop]: Abstraction has 235389 states and 357371 transitions. [2024-11-11 21:20:52,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:20:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 235389 states and 357371 transitions. [2024-11-11 21:20:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 21:20:52,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:52,990 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:52,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:20:52,991 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:52,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1396379120, now seen corresponding path program 1 times [2024-11-11 21:20:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:52,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499334869] [2024-11-11 21:20:52,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:52,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499334869] [2024-11-11 21:20:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499334869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:53,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:53,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780394228] [2024-11-11 21:20:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:53,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:53,109 INFO L87 Difference]: Start difference. First operand 235389 states and 357371 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:20:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:54,933 INFO L93 Difference]: Finished difference Result 335200 states and 508756 transitions. [2024-11-11 21:20:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:54,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-11 21:20:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:55,202 INFO L225 Difference]: With dead ends: 335200 [2024-11-11 21:20:55,202 INFO L226 Difference]: Without dead ends: 99954 [2024-11-11 21:20:55,322 INFO L434 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-11-11 21:20:55,323 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 58 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:55,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 381 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99954 states. [2024-11-11 21:20:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99954 to 99671. [2024-11-11 21:20:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99671 states, 99670 states have (on average 1.508026487408448) internal successors, (150305), 99670 states have internal predecessors, (150305), 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-11-11 21:20:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99671 states to 99671 states and 150305 transitions. [2024-11-11 21:20:57,946 INFO L78 Accepts]: Start accepts. Automaton has 99671 states and 150305 transitions. Word has length 109 [2024-11-11 21:20:57,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:57,946 INFO L471 AbstractCegarLoop]: Abstraction has 99671 states and 150305 transitions. [2024-11-11 21:20:57,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:20:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 99671 states and 150305 transitions. [2024-11-11 21:20:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 21:20:57,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:57,949 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:57,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:20:57,949 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:57,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1844845744, now seen corresponding path program 1 times [2024-11-11 21:20:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:57,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194709101] [2024-11-11 21:20:57,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:20:58,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194709101] [2024-11-11 21:20:58,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194709101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:58,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:58,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:20:58,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077088720] [2024-11-11 21:20:58,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:58,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:20:58,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:58,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:20:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:20:58,101 INFO L87 Difference]: Start difference. First operand 99671 states and 150305 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:20:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:59,113 INFO L93 Difference]: Finished difference Result 141578 states and 213508 transitions. [2024-11-11 21:20:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:20:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-11 21:20:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:59,191 INFO L225 Difference]: With dead ends: 141578 [2024-11-11 21:20:59,191 INFO L226 Difference]: Without dead ends: 42052 [2024-11-11 21:20:59,233 INFO L434 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-11-11 21:20:59,234 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 45 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:59,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 356 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:20:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42052 states. [2024-11-11 21:20:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42052 to 41961. [2024-11-11 21:20:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41961 states, 41960 states have (on average 1.4994518589132506) internal successors, (62917), 41960 states have internal predecessors, (62917), 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-11-11 21:20:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41961 states to 41961 states and 62917 transitions. [2024-11-11 21:20:59,824 INFO L78 Accepts]: Start accepts. Automaton has 41961 states and 62917 transitions. Word has length 109 [2024-11-11 21:20:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:59,825 INFO L471 AbstractCegarLoop]: Abstraction has 41961 states and 62917 transitions. [2024-11-11 21:20:59,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:20:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 41961 states and 62917 transitions. [2024-11-11 21:20:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 21:20:59,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:59,828 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:20:59,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:20:59,829 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:59,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash -734383299, now seen corresponding path program 1 times [2024-11-11 21:20:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000620191] [2024-11-11 21:20:59,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:21:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:00,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000620191] [2024-11-11 21:21:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000620191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:00,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:00,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:21:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668324451] [2024-11-11 21:21:00,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:00,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:21:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:00,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:21:00,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:21:00,494 INFO L87 Difference]: Start difference. First operand 41961 states and 62917 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-11-11 21:21:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:01,373 INFO L93 Difference]: Finished difference Result 105714 states and 157985 transitions. [2024-11-11 21:21:01,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:21:01,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 110 [2024-11-11 21:21:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:01,506 INFO L225 Difference]: With dead ends: 105714 [2024-11-11 21:21:01,506 INFO L226 Difference]: Without dead ends: 79346 [2024-11-11 21:21:01,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:21:01,551 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 284 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:01,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 547 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:21:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79346 states. [2024-11-11 21:21:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79346 to 66540. [2024-11-11 21:21:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66540 states, 66539 states have (on average 1.4978583988337666) internal successors, (99666), 66539 states have internal predecessors, (99666), 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-11-11 21:21:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66540 states to 66540 states and 99666 transitions. [2024-11-11 21:21:03,196 INFO L78 Accepts]: Start accepts. Automaton has 66540 states and 99666 transitions. Word has length 110 [2024-11-11 21:21:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:21:03,197 INFO L471 AbstractCegarLoop]: Abstraction has 66540 states and 99666 transitions. [2024-11-11 21:21:03,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-11-11 21:21:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 66540 states and 99666 transitions. [2024-11-11 21:21:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 21:21:03,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:21:03,199 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:21:03,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:21:03,203 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:21:03,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:21:03,203 INFO L85 PathProgramCache]: Analyzing trace with hash -774421790, now seen corresponding path program 1 times [2024-11-11 21:21:03,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:21:03,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306971291] [2024-11-11 21:21:03,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:21:03,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:21:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:21:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:21:03,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:21:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306971291] [2024-11-11 21:21:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306971291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:21:03,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:21:03,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:21:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241602427] [2024-11-11 21:21:03,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:21:03,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:21:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:21:03,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:21:03,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:21:03,606 INFO L87 Difference]: Start difference. First operand 66540 states and 99666 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-11 21:21:04,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:21:04,987 INFO L93 Difference]: Finished difference Result 162884 states and 243459 transitions. [2024-11-11 21:21:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:21:04,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 110 [2024-11-11 21:21:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:21:05,220 INFO L225 Difference]: With dead ends: 162884 [2024-11-11 21:21:05,220 INFO L226 Difference]: Without dead ends: 122992 [2024-11-11 21:21:05,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:21:05,268 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 295 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:21:05,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 539 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:21:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122992 states.