./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 ccd7de77f49c6b9ff6e2bd62edbddc630c5186aa67a4c3123f05914f38eca6d7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:22:14,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:22:14,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:22:14,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:22:14,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:22:14,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:22:14,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:22:14,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:22:14,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:22:14,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:22:14,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:22:14,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:22:14,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:22:14,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:22:14,366 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:22:14,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:22:14,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:22:14,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:22:14,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:22:14,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:22:14,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:22:14,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:22:14,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:22:14,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:22:14,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:22:14,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:22:14,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:22:14,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:22:14,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:22:14,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:22:14,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:22:14,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:22:14,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:22:14,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:22:14,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:22:14,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:22:14,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:22:14,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:22:14,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:22:14,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:22:14,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:22:14,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:22:14,376 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 -> ccd7de77f49c6b9ff6e2bd62edbddc630c5186aa67a4c3123f05914f38eca6d7 [2024-10-12 20:22:14,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:22:14,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:22:14,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:22:14,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:22:14,598 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:22:14,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:22:15,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:22:16,070 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:22:16,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:22:16,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f38a5766/f9f451d208154a238d58cb8941056448/FLAG0d48e56a6 [2024-10-12 20:22:16,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f38a5766/f9f451d208154a238d58cb8941056448 [2024-10-12 20:22:16,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:22:16,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:22:16,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:22:16,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:22:16,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:22:16,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269b38ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16, skipping insertion in model container [2024-10-12 20:22:16,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:22:16,327 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2024-10-12 20:22:16,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:22:16,372 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:22:16,410 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2024-10-12 20:22:16,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:22:16,441 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:22:16,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16 WrapperNode [2024-10-12 20:22:16,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:22:16,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:22:16,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:22:16,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:22:16,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,497 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 452 [2024-10-12 20:22:16,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:22:16,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:22:16,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:22:16,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:22:16,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:22:16,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:22:16,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:22:16,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:22:16,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:22:16,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (1/1) ... [2024-10-12 20:22:16,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:22:16,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:22:16,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:22:16,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:22:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:22:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:22:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:22:16,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:22:16,768 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:22:16,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:22:17,254 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-12 20:22:17,255 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:22:17,287 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:22:17,287 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:22:17,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:22:17 BoogieIcfgContainer [2024-10-12 20:22:17,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:22:17,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:22:17,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:22:17,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:22:17,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:22:16" (1/3) ... [2024-10-12 20:22:17,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f89ba84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:22:17, skipping insertion in model container [2024-10-12 20:22:17,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:16" (2/3) ... [2024-10-12 20:22:17,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f89ba84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:22:17, skipping insertion in model container [2024-10-12 20:22:17,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:22:17" (3/3) ... [2024-10-12 20:22:17,302 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:22:17,328 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:22:17,328 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:22:17,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:22:17,392 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;@3d6b8527, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:22:17,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:22:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 103 states have (on average 1.6990291262135921) internal successors, (175), 104 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 20:22:17,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:17,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:17,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:17,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash -813563245, now seen corresponding path program 1 times [2024-10-12 20:22:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:17,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201878553] [2024-10-12 20:22:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:17,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:17,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201878553] [2024-10-12 20:22:17,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201878553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:17,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:17,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316557739] [2024-10-12 20:22:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:17,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:17,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:17,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:17,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:17,752 INFO L87 Difference]: Start difference. First operand has 105 states, 103 states have (on average 1.6990291262135921) internal successors, (175), 104 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:17,805 INFO L93 Difference]: Finished difference Result 247 states and 397 transitions. [2024-10-12 20:22:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:17,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-12 20:22:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:17,817 INFO L225 Difference]: With dead ends: 247 [2024-10-12 20:22:17,817 INFO L226 Difference]: Without dead ends: 164 [2024-10-12 20:22:17,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:17,822 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 122 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:17,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 360 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-12 20:22:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-10-12 20:22:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.5031055900621118) internal successors, (242), 161 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 242 transitions. [2024-10-12 20:22:17,854 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 242 transitions. Word has length 47 [2024-10-12 20:22:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:17,855 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 242 transitions. [2024-10-12 20:22:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 242 transitions. [2024-10-12 20:22:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 20:22:17,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:17,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:17,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:22:17,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:17,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2090397033, now seen corresponding path program 1 times [2024-10-12 20:22:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:17,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246356190] [2024-10-12 20:22:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246356190] [2024-10-12 20:22:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246356190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:17,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:17,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886355444] [2024-10-12 20:22:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:17,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:17,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:17,972 INFO L87 Difference]: Start difference. First operand 162 states and 242 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:17,994 INFO L93 Difference]: Finished difference Result 402 states and 622 transitions. [2024-10-12 20:22:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:17,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-12 20:22:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:17,996 INFO L225 Difference]: With dead ends: 402 [2024-10-12 20:22:17,996 INFO L226 Difference]: Without dead ends: 266 [2024-10-12 20:22:17,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:17,997 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 101 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:17,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 311 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-12 20:22:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-10-12 20:22:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.532319391634981) internal successors, (403), 263 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 403 transitions. [2024-10-12 20:22:18,010 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 403 transitions. Word has length 48 [2024-10-12 20:22:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:18,011 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 403 transitions. [2024-10-12 20:22:18,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 403 transitions. [2024-10-12 20:22:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:22:18,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:18,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:18,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:22:18,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:18,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2059387344, now seen corresponding path program 1 times [2024-10-12 20:22:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644107812] [2024-10-12 20:22:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:18,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:18,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644107812] [2024-10-12 20:22:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644107812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:18,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130321970] [2024-10-12 20:22:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:18,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:18,130 INFO L87 Difference]: Start difference. First operand 264 states and 403 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:18,157 INFO L93 Difference]: Finished difference Result 676 states and 1053 transitions. [2024-10-12 20:22:18,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:18,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-12 20:22:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:18,160 INFO L225 Difference]: With dead ends: 676 [2024-10-12 20:22:18,162 INFO L226 Difference]: Without dead ends: 438 [2024-10-12 20:22:18,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:18,164 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 96 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:18,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 296 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-12 20:22:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2024-10-12 20:22:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.542528735632184) internal successors, (671), 435 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 671 transitions. [2024-10-12 20:22:18,183 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 671 transitions. Word has length 49 [2024-10-12 20:22:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:18,183 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 671 transitions. [2024-10-12 20:22:18,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 671 transitions. [2024-10-12 20:22:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:22:18,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:18,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:22:18,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:18,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash 343137598, now seen corresponding path program 1 times [2024-10-12 20:22:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305712017] [2024-10-12 20:22:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305712017] [2024-10-12 20:22:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305712017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:18,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:18,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554603685] [2024-10-12 20:22:18,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:18,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:22:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:22:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:18,328 INFO L87 Difference]: Start difference. First operand 436 states and 671 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:18,433 INFO L93 Difference]: Finished difference Result 2486 states and 3896 transitions. [2024-10-12 20:22:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:22:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-12 20:22:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:18,440 INFO L225 Difference]: With dead ends: 2486 [2024-10-12 20:22:18,440 INFO L226 Difference]: Without dead ends: 2076 [2024-10-12 20:22:18,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:22:18,444 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 953 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:18,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1084 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2024-10-12 20:22:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 844. [2024-10-12 20:22:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.5409252669039146) internal successors, (1299), 843 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1299 transitions. [2024-10-12 20:22:18,484 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1299 transitions. Word has length 50 [2024-10-12 20:22:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:18,485 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1299 transitions. [2024-10-12 20:22:18,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1299 transitions. [2024-10-12 20:22:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:22:18,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:18,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:18,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:22:18,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:18,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2027874669, now seen corresponding path program 1 times [2024-10-12 20:22:18,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807406801] [2024-10-12 20:22:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:18,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:18,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:18,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807406801] [2024-10-12 20:22:18,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807406801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:18,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:18,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:18,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609347133] [2024-10-12 20:22:18,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:18,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:22:18,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:18,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:22:18,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:18,660 INFO L87 Difference]: Start difference. First operand 844 states and 1299 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:18,751 INFO L93 Difference]: Finished difference Result 3708 states and 5719 transitions. [2024-10-12 20:22:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:22:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-12 20:22:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:18,759 INFO L225 Difference]: With dead ends: 3708 [2024-10-12 20:22:18,759 INFO L226 Difference]: Without dead ends: 2890 [2024-10-12 20:22:18,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:18,761 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 435 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:18,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 849 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2024-10-12 20:22:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2884. [2024-10-12 20:22:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2883 states have (on average 1.5355532431494971) internal successors, (4427), 2883 states have internal predecessors, (4427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4427 transitions. [2024-10-12 20:22:18,811 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4427 transitions. Word has length 51 [2024-10-12 20:22:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:18,813 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4427 transitions. [2024-10-12 20:22:18,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4427 transitions. [2024-10-12 20:22:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:22:18,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:18,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:18,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:22:18,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:18,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 994594015, now seen corresponding path program 1 times [2024-10-12 20:22:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:18,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418205162] [2024-10-12 20:22:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:18,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418205162] [2024-10-12 20:22:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418205162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:18,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615156881] [2024-10-12 20:22:18,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:18,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:18,885 INFO L87 Difference]: Start difference. First operand 2884 states and 4427 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:18,919 INFO L93 Difference]: Finished difference Result 7768 states and 11885 transitions. [2024-10-12 20:22:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:18,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 20:22:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:18,933 INFO L225 Difference]: With dead ends: 7768 [2024-10-12 20:22:18,934 INFO L226 Difference]: Without dead ends: 4910 [2024-10-12 20:22:18,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:18,940 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 107 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:18,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 359 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4910 states. [2024-10-12 20:22:18,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4910 to 4908. [2024-10-12 20:22:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 4907 states have (on average 1.5119217444467088) internal successors, (7419), 4907 states have internal predecessors, (7419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 7419 transitions. [2024-10-12 20:22:19,013 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 7419 transitions. Word has length 53 [2024-10-12 20:22:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:19,014 INFO L471 AbstractCegarLoop]: Abstraction has 4908 states and 7419 transitions. [2024-10-12 20:22:19,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 7419 transitions. [2024-10-12 20:22:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:22:19,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:19,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:19,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:22:19,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:19,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 200165270, now seen corresponding path program 1 times [2024-10-12 20:22:19,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:19,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44944875] [2024-10-12 20:22:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:19,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44944875] [2024-10-12 20:22:19,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44944875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:19,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:19,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:22:19,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649427874] [2024-10-12 20:22:19,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:19,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:22:19,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:19,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:22:19,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:22:19,140 INFO L87 Difference]: Start difference. First operand 4908 states and 7419 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:19,289 INFO L93 Difference]: Finished difference Result 14672 states and 22205 transitions. [2024-10-12 20:22:19,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:22:19,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 20:22:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:19,311 INFO L225 Difference]: With dead ends: 14672 [2024-10-12 20:22:19,311 INFO L226 Difference]: Without dead ends: 9790 [2024-10-12 20:22:19,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:19,320 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 631 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:19,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 175 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9790 states. [2024-10-12 20:22:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9790 to 9788. [2024-10-12 20:22:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9788 states, 9787 states have (on average 1.503525084295494) internal successors, (14715), 9787 states have internal predecessors, (14715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9788 states to 9788 states and 14715 transitions. [2024-10-12 20:22:19,587 INFO L78 Accepts]: Start accepts. Automaton has 9788 states and 14715 transitions. Word has length 53 [2024-10-12 20:22:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:19,587 INFO L471 AbstractCegarLoop]: Abstraction has 9788 states and 14715 transitions. [2024-10-12 20:22:19,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9788 states and 14715 transitions. [2024-10-12 20:22:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:22:19,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:19,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:19,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:22:19,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:19,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -614246725, now seen corresponding path program 1 times [2024-10-12 20:22:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118312700] [2024-10-12 20:22:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:19,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118312700] [2024-10-12 20:22:19,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118312700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:19,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:19,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:22:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500106636] [2024-10-12 20:22:19,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:19,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:22:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:22:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:22:19,815 INFO L87 Difference]: Start difference. First operand 9788 states and 14715 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:19,861 INFO L93 Difference]: Finished difference Result 10302 states and 15484 transitions. [2024-10-12 20:22:19,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:22:19,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 20:22:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:19,897 INFO L225 Difference]: With dead ends: 10302 [2024-10-12 20:22:19,897 INFO L226 Difference]: Without dead ends: 10300 [2024-10-12 20:22:19,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:22:19,903 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:19,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 569 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10300 states. [2024-10-12 20:22:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10300 to 10300. [2024-10-12 20:22:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10300 states, 10299 states have (on average 1.4784930575784057) internal successors, (15227), 10299 states have internal predecessors, (15227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 15227 transitions. [2024-10-12 20:22:20,113 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 15227 transitions. Word has length 53 [2024-10-12 20:22:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:20,113 INFO L471 AbstractCegarLoop]: Abstraction has 10300 states and 15227 transitions. [2024-10-12 20:22:20,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 15227 transitions. [2024-10-12 20:22:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:22:20,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:20,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:20,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:22:20,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:20,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1851206240, now seen corresponding path program 1 times [2024-10-12 20:22:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136072293] [2024-10-12 20:22:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:20,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136072293] [2024-10-12 20:22:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136072293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:20,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:20,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415543465] [2024-10-12 20:22:20,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:20,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:20,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:20,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:20,168 INFO L87 Difference]: Start difference. First operand 10300 states and 15227 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:20,228 INFO L93 Difference]: Finished difference Result 25042 states and 37003 transitions. [2024-10-12 20:22:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:20,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:22:20,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:20,251 INFO L225 Difference]: With dead ends: 25042 [2024-10-12 20:22:20,252 INFO L226 Difference]: Without dead ends: 14768 [2024-10-12 20:22:20,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:20,264 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 85 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:20,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14768 states. [2024-10-12 20:22:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14768 to 14654. [2024-10-12 20:22:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14654 states, 14653 states have (on average 1.464887736299734) internal successors, (21465), 14653 states have internal predecessors, (21465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14654 states to 14654 states and 21465 transitions. [2024-10-12 20:22:20,568 INFO L78 Accepts]: Start accepts. Automaton has 14654 states and 21465 transitions. Word has length 54 [2024-10-12 20:22:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:20,568 INFO L471 AbstractCegarLoop]: Abstraction has 14654 states and 21465 transitions. [2024-10-12 20:22:20,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 14654 states and 21465 transitions. [2024-10-12 20:22:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:22:20,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:20,573 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:22:20,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:22:20,574 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:20,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1774240818, now seen corresponding path program 1 times [2024-10-12 20:22:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:20,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257982755] [2024-10-12 20:22:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:20,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257982755] [2024-10-12 20:22:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257982755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:20,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:20,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:20,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997694801] [2024-10-12 20:22:20,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:20,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:20,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:20,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:20,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:20,633 INFO L87 Difference]: Start difference. First operand 14654 states and 21465 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:20,708 INFO L93 Difference]: Finished difference Result 28164 states and 41181 transitions. [2024-10-12 20:22:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:20,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-12 20:22:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:20,822 INFO L225 Difference]: With dead ends: 28164 [2024-10-12 20:22:20,823 INFO L226 Difference]: Without dead ends: 20098 [2024-10-12 20:22:20,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:20,832 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 86 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:20,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 310 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20098 states. [2024-10-12 20:22:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20098 to 18848. [2024-10-12 20:22:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18848 states, 18847 states have (on average 1.446118745688969) internal successors, (27255), 18847 states have internal predecessors, (27255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18848 states to 18848 states and 27255 transitions. [2024-10-12 20:22:21,124 INFO L78 Accepts]: Start accepts. Automaton has 18848 states and 27255 transitions. Word has length 76 [2024-10-12 20:22:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:21,124 INFO L471 AbstractCegarLoop]: Abstraction has 18848 states and 27255 transitions. [2024-10-12 20:22:21,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 18848 states and 27255 transitions. [2024-10-12 20:22:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:22:21,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:21,130 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:22:21,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:22:21,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:21,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash 644043701, now seen corresponding path program 1 times [2024-10-12 20:22:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:21,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745870486] [2024-10-12 20:22:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745870486] [2024-10-12 20:22:21,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745870486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:21,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:21,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744663024] [2024-10-12 20:22:21,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:21,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:21,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:21,179 INFO L87 Difference]: Start difference. First operand 18848 states and 27255 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:21,244 INFO L93 Difference]: Finished difference Result 29471 states and 42418 transitions. [2024-10-12 20:22:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:21,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-12 20:22:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:21,267 INFO L225 Difference]: With dead ends: 29471 [2024-10-12 20:22:21,267 INFO L226 Difference]: Without dead ends: 19980 [2024-10-12 20:22:21,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:21,280 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 87 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:21,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 329 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19980 states. [2024-10-12 20:22:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19980 to 19255. [2024-10-12 20:22:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19255 states, 19254 states have (on average 1.4222499220941103) internal successors, (27384), 19254 states have internal predecessors, (27384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19255 states to 19255 states and 27384 transitions. [2024-10-12 20:22:21,724 INFO L78 Accepts]: Start accepts. Automaton has 19255 states and 27384 transitions. Word has length 76 [2024-10-12 20:22:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:21,724 INFO L471 AbstractCegarLoop]: Abstraction has 19255 states and 27384 transitions. [2024-10-12 20:22:21,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19255 states and 27384 transitions. [2024-10-12 20:22:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:22:21,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:21,729 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:22:21,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:22:21,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:21,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1569217297, now seen corresponding path program 1 times [2024-10-12 20:22:21,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759070647] [2024-10-12 20:22:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:21,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:22:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759070647] [2024-10-12 20:22:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759070647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42270546] [2024-10-12 20:22:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:21,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:22:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:22:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:21,863 INFO L87 Difference]: Start difference. First operand 19255 states and 27384 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:22,114 INFO L93 Difference]: Finished difference Result 42705 states and 61533 transitions. [2024-10-12 20:22:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:22:22,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 76 [2024-10-12 20:22:22,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:22,174 INFO L225 Difference]: With dead ends: 42705 [2024-10-12 20:22:22,175 INFO L226 Difference]: Without dead ends: 34418 [2024-10-12 20:22:22,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:22:22,189 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 702 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:22,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 979 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34418 states. [2024-10-12 20:22:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34418 to 26262. [2024-10-12 20:22:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26262 states, 26261 states have (on average 1.4234416054224897) internal successors, (37381), 26261 states have internal predecessors, (37381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26262 states to 26262 states and 37381 transitions. [2024-10-12 20:22:22,533 INFO L78 Accepts]: Start accepts. Automaton has 26262 states and 37381 transitions. Word has length 76 [2024-10-12 20:22:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:22,533 INFO L471 AbstractCegarLoop]: Abstraction has 26262 states and 37381 transitions. [2024-10-12 20:22:22,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 26262 states and 37381 transitions. [2024-10-12 20:22:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:22:22,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:22,539 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:22:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:22:22,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:22,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash 501121061, now seen corresponding path program 1 times [2024-10-12 20:22:22,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:22,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737080587] [2024-10-12 20:22:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:22:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:22,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737080587] [2024-10-12 20:22:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737080587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:22,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:22,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868721669] [2024-10-12 20:22:22,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:22,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:22:22,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:22,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:22:22,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:22,661 INFO L87 Difference]: Start difference. First operand 26262 states and 37381 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-10-12 20:22:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:23,049 INFO L93 Difference]: Finished difference Result 46157 states and 66434 transitions. [2024-10-12 20:22:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:22:23,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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 76 [2024-10-12 20:22:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:23,149 INFO L225 Difference]: With dead ends: 46157 [2024-10-12 20:22:23,153 INFO L226 Difference]: Without dead ends: 40208 [2024-10-12 20:22:23,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:22:23,179 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 742 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:23,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 880 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40208 states. [2024-10-12 20:22:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40208 to 32070. [2024-10-12 20:22:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32070 states, 32069 states have (on average 1.4250834138888022) internal successors, (45701), 32069 states have internal predecessors, (45701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32070 states to 32070 states and 45701 transitions. [2024-10-12 20:22:23,777 INFO L78 Accepts]: Start accepts. Automaton has 32070 states and 45701 transitions. Word has length 76 [2024-10-12 20:22:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:23,777 INFO L471 AbstractCegarLoop]: Abstraction has 32070 states and 45701 transitions. [2024-10-12 20:22:23,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-10-12 20:22:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 32070 states and 45701 transitions. [2024-10-12 20:22:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:22:23,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:23,784 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:22:23,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:22:23,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:23,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash 256605818, now seen corresponding path program 1 times [2024-10-12 20:22:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:23,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593914362] [2024-10-12 20:22:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:22:24,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:24,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593914362] [2024-10-12 20:22:24,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593914362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:24,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:24,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:24,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419934877] [2024-10-12 20:22:24,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:24,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:22:24,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:24,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:22:24,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:24,073 INFO L87 Difference]: Start difference. First operand 32070 states and 45701 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:24,221 INFO L93 Difference]: Finished difference Result 48034 states and 69036 transitions. [2024-10-12 20:22:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:22:24,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 76 [2024-10-12 20:22:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:24,269 INFO L225 Difference]: With dead ends: 48034 [2024-10-12 20:22:24,269 INFO L226 Difference]: Without dead ends: 44088 [2024-10-12 20:22:24,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:22:24,285 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 716 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:24,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 900 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44088 states. [2024-10-12 20:22:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44088 to 35950. [2024-10-12 20:22:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35950 states, 35949 states have (on average 1.4261592812039279) internal successors, (51269), 35949 states have internal predecessors, (51269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35950 states to 35950 states and 51269 transitions. [2024-10-12 20:22:24,821 INFO L78 Accepts]: Start accepts. Automaton has 35950 states and 51269 transitions. Word has length 76 [2024-10-12 20:22:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:24,821 INFO L471 AbstractCegarLoop]: Abstraction has 35950 states and 51269 transitions. [2024-10-12 20:22:24,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 35950 states and 51269 transitions. [2024-10-12 20:22:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:22:24,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:24,827 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:22:24,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:22:24,827 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:24,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash 623948307, now seen corresponding path program 1 times [2024-10-12 20:22:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:24,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794123885] [2024-10-12 20:22:24,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:24,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:25,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794123885] [2024-10-12 20:22:25,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794123885] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:22:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375206117] [2024-10-12 20:22:25,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:25,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:22:25,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:22:25,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:22:25,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:22:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:25,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 20:22:25,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:22:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:25,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:22:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:26,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375206117] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:22:26,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:22:26,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 25 [2024-10-12 20:22:26,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688915032] [2024-10-12 20:22:26,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:22:26,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-12 20:22:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:26,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 20:22:26,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:22:26,363 INFO L87 Difference]: Start difference. First operand 35950 states and 51269 transitions. Second operand has 25 states, 25 states have (on average 8.92) internal successors, (223), 25 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-10-12 20:22:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:36,519 INFO L93 Difference]: Finished difference Result 291114 states and 411251 transitions. [2024-10-12 20:22:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2024-10-12 20:22:36,520 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.92) internal successors, (223), 25 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) Word has length 77 [2024-10-12 20:22:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:37,032 INFO L225 Difference]: With dead ends: 291114 [2024-10-12 20:22:37,032 INFO L226 Difference]: Without dead ends: 253296 [2024-10-12 20:22:37,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14746 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5366, Invalid=29416, Unknown=0, NotChecked=0, Total=34782 [2024-10-12 20:22:37,086 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 11923 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11923 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 3411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:37,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11923 Valid, 2923 Invalid, 3411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 20:22:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253296 states. [2024-10-12 20:22:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253296 to 200844. [2024-10-12 20:22:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200844 states, 200843 states have (on average 1.3987393137923652) internal successors, (280927), 200843 states have internal predecessors, (280927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200844 states to 200844 states and 280927 transitions. [2024-10-12 20:22:40,585 INFO L78 Accepts]: Start accepts. Automaton has 200844 states and 280927 transitions. Word has length 77 [2024-10-12 20:22:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 200844 states and 280927 transitions. [2024-10-12 20:22:40,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.92) internal successors, (223), 25 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-10-12 20:22:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 200844 states and 280927 transitions. [2024-10-12 20:22:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:22:40,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:40,590 INFO L215 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] [2024-10-12 20:22:40,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:22:40,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-12 20:22:40,792 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:40,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1272026816, now seen corresponding path program 1 times [2024-10-12 20:22:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:40,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69185399] [2024-10-12 20:22:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:40,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69185399] [2024-10-12 20:22:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69185399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:40,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483026244] [2024-10-12 20:22:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:40,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:40,883 INFO L87 Difference]: Start difference. First operand 200844 states and 280927 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:42,907 INFO L93 Difference]: Finished difference Result 567495 states and 791346 transitions. [2024-10-12 20:22:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:42,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-12 20:22:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:43,466 INFO L225 Difference]: With dead ends: 567495 [2024-10-12 20:22:43,467 INFO L226 Difference]: Without dead ends: 376085 [2024-10-12 20:22:43,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:43,578 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 81 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:43,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 293 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376085 states. [2024-10-12 20:22:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376085 to 375896. [2024-10-12 20:22:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375896 states, 375895 states have (on average 1.380066241902659) internal successors, (518760), 375895 states have internal predecessors, (518760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375896 states to 375896 states and 518760 transitions. [2024-10-12 20:22:49,888 INFO L78 Accepts]: Start accepts. Automaton has 375896 states and 518760 transitions. Word has length 78 [2024-10-12 20:22:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:49,888 INFO L471 AbstractCegarLoop]: Abstraction has 375896 states and 518760 transitions. [2024-10-12 20:22:49,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 375896 states and 518760 transitions. [2024-10-12 20:22:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:22:49,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:49,905 INFO L215 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] [2024-10-12 20:22:49,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:22:49,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:49,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:49,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2114294557, now seen corresponding path program 1 times [2024-10-12 20:22:49,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:49,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052681430] [2024-10-12 20:22:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:49,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:22:50,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:50,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052681430] [2024-10-12 20:22:50,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052681430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:50,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:50,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:50,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557028034] [2024-10-12 20:22:50,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:50,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:22:50,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:50,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:22:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:50,121 INFO L87 Difference]: Start difference. First operand 375896 states and 518760 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:51,917 INFO L93 Difference]: Finished difference Result 664803 states and 925030 transitions. [2024-10-12 20:22:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:22:51,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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 79 [2024-10-12 20:22:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:52,729 INFO L225 Difference]: With dead ends: 664803 [2024-10-12 20:22:52,729 INFO L226 Difference]: Without dead ends: 572881 [2024-10-12 20:22:52,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:22:52,847 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 694 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:52,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 983 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572881 states. [2024-10-12 20:22:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572881 to 449426. [2024-10-12 20:22:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449426 states, 449425 states have (on average 1.378652722923736) internal successors, (619601), 449425 states have internal predecessors, (619601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449426 states to 449426 states and 619601 transitions. [2024-10-12 20:23:00,827 INFO L78 Accepts]: Start accepts. Automaton has 449426 states and 619601 transitions. Word has length 79 [2024-10-12 20:23:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:00,827 INFO L471 AbstractCegarLoop]: Abstraction has 449426 states and 619601 transitions. [2024-10-12 20:23:00,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 449426 states and 619601 transitions. [2024-10-12 20:23:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:23:00,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:00,835 INFO L215 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] [2024-10-12 20:23:00,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:23:00,836 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:00,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1845468041, now seen corresponding path program 1 times [2024-10-12 20:23:00,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:00,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029224355] [2024-10-12 20:23:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029224355] [2024-10-12 20:23:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029224355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:00,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:00,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95066472] [2024-10-12 20:23:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:00,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:00,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:00,915 INFO L87 Difference]: Start difference. First operand 449426 states and 619601 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-10-12 20:23:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:04,786 INFO L93 Difference]: Finished difference Result 963729 states and 1327325 transitions. [2024-10-12 20:23:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:04,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-10-12 20:23:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:05,639 INFO L225 Difference]: With dead ends: 963729 [2024-10-12 20:23:05,640 INFO L226 Difference]: Without dead ends: 523002 [2024-10-12 20:23:05,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:05,839 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:05,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 323 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]