./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_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2b4e579e156345915e1fde26fcd53bce80a36e2067cd5c9341971cdf8691491e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:35:28,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:35:28,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:35:28,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:35:28,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:35:28,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:35:28,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:35:28,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:35:28,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:35:28,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:35:28,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:35:28,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:35:28,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:35:28,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:35:28,734 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:35:28,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:35:28,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:35:28,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:35:28,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:35:28,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:35:28,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:35:28,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:35:28,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:35:28,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:35:28,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:35:28,740 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:35:28,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:35:28,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:35:28,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:35:28,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:35:28,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:35:28,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:35:28,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:35:28,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:35:28,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:35:28,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:35:28,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:35:28,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:35:28,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:35:28,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:35:28,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:35:28,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:35:28,745 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-clean/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-clean/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 -> 2b4e579e156345915e1fde26fcd53bce80a36e2067cd5c9341971cdf8691491e [2024-10-11 03:35:29,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:35:29,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:35:29,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:35:29,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:35:29,043 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:35:29,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-10-11 03:35:30,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:35:30,789 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:35:30,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-10-11 03:35:30,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bc4b4e33b/9196117f87ba4be8a6712c1450c4f976/FLAG9b9549b0b [2024-10-11 03:35:30,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bc4b4e33b/9196117f87ba4be8a6712c1450c4f976 [2024-10-11 03:35:30,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:35:30,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:35:30,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:35:30,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:35:30,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:35:30,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:35:30" (1/1) ... [2024-10-11 03:35:30,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4463a31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:30, skipping insertion in model container [2024-10-11 03:35:30,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:35:30" (1/1) ... [2024-10-11 03:35:30,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:35:31,181 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_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12498,12511] [2024-10-11 03:35:31,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:35:31,292 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:35:31,365 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_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12498,12511] [2024-10-11 03:35:31,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:35:31,453 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:35:31,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31 WrapperNode [2024-10-11 03:35:31,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:35:31,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:35:31,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:35:31,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:35:31,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,557 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1327 [2024-10-11 03:35:31,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:35:31,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:35:31,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:35:31,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:35:31,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,634 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-11 03:35:31,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:35:31,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:35:31,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:35:31,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:35:31,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (1/1) ... [2024-10-11 03:35:31,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:35:31,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:35:31,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:35:31,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:35:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:35:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:35:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:35:31,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:35:32,022 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:35:32,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:35:33,161 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-11 03:35:33,162 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:35:33,258 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:35:33,258 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:35:33,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:35:33 BoogieIcfgContainer [2024-10-11 03:35:33,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:35:33,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:35:33,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:35:33,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:35:33,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:35:30" (1/3) ... [2024-10-11 03:35:33,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:35:33, skipping insertion in model container [2024-10-11 03:35:33,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:31" (2/3) ... [2024-10-11 03:35:33,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:35:33, skipping insertion in model container [2024-10-11 03:35:33,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:35:33" (3/3) ... [2024-10-11 03:35:33,271 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-10-11 03:35:33,289 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:35:33,289 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:35:33,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:35:33,380 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;@6bf97b97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:35:33,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:35:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 303 states have (on average 1.801980198019802) internal successors, (546), 304 states have internal predecessors, (546), 0 states have call successors, (0), 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-11 03:35:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:35:33,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:33,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:33,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:33,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash 692383995, now seen corresponding path program 1 times [2024-10-11 03:35:33,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:33,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303746304] [2024-10-11 03:35:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:34,175 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-11 03:35:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303746304] [2024-10-11 03:35:34,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303746304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:34,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:34,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329377327] [2024-10-11 03:35:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:34,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:34,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:34,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:34,236 INFO L87 Difference]: Start difference. First operand has 305 states, 303 states have (on average 1.801980198019802) internal successors, (546), 304 states have internal predecessors, (546), 0 states have call successors, (0), 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 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-11 03:35:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:34,402 INFO L93 Difference]: Finished difference Result 552 states and 963 transitions. [2024-10-11 03:35:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:34,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-10-11 03:35:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:34,429 INFO L225 Difference]: With dead ends: 552 [2024-10-11 03:35:34,429 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 03:35:34,433 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-11 03:35:34,437 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 209 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:34,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1030 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 03:35:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2024-10-11 03:35:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.6850961538461537) internal successors, (701), 416 states have internal predecessors, (701), 0 states have call successors, (0), 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-11 03:35:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 701 transitions. [2024-10-11 03:35:34,513 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 701 transitions. Word has length 98 [2024-10-11 03:35:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:34,516 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 701 transitions. [2024-10-11 03:35:34,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-11 03:35:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 701 transitions. [2024-10-11 03:35:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:35:34,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:34,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:34,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:35:34,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:34,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1152779503, now seen corresponding path program 1 times [2024-10-11 03:35:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923505741] [2024-10-11 03:35:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:34,805 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-11 03:35:34,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:34,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923505741] [2024-10-11 03:35:34,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923505741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:34,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838265069] [2024-10-11 03:35:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:34,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:34,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:34,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:34,812 INFO L87 Difference]: Start difference. First operand 417 states and 701 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-11 03:35:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:34,880 INFO L93 Difference]: Finished difference Result 881 states and 1477 transitions. [2024-10-11 03:35:34,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:34,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-11 03:35:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:34,889 INFO L225 Difference]: With dead ends: 881 [2024-10-11 03:35:34,889 INFO L226 Difference]: Without dead ends: 640 [2024-10-11 03:35:34,891 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-11 03:35:34,892 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 189 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:34,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 995 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-11 03:35:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 638. [2024-10-11 03:35:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 1.6781789638932496) internal successors, (1069), 637 states have internal predecessors, (1069), 0 states have call successors, (0), 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-11 03:35:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1069 transitions. [2024-10-11 03:35:34,940 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1069 transitions. Word has length 101 [2024-10-11 03:35:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:34,941 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 1069 transitions. [2024-10-11 03:35:34,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-11 03:35:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1069 transitions. [2024-10-11 03:35:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:35:34,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:34,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:34,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:35:34,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:34,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1401790303, now seen corresponding path program 1 times [2024-10-11 03:35:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:34,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064757199] [2024-10-11 03:35:34,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:34,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:35,185 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-11 03:35:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:35,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064757199] [2024-10-11 03:35:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064757199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:35,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:35,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936188192] [2024-10-11 03:35:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:35,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:35,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:35,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:35,192 INFO L87 Difference]: Start difference. First operand 638 states and 1069 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-11 03:35:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:35,253 INFO L93 Difference]: Finished difference Result 1526 states and 2547 transitions. [2024-10-11 03:35:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:35,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-10-11 03:35:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:35,259 INFO L225 Difference]: With dead ends: 1526 [2024-10-11 03:35:35,259 INFO L226 Difference]: Without dead ends: 1064 [2024-10-11 03:35:35,264 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-11 03:35:35,265 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 183 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:35,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1075 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-10-11 03:35:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1062. [2024-10-11 03:35:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.6672950047125354) internal successors, (1769), 1061 states have internal predecessors, (1769), 0 states have call successors, (0), 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-11 03:35:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1769 transitions. [2024-10-11 03:35:35,300 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1769 transitions. Word has length 104 [2024-10-11 03:35:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:35,300 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1769 transitions. [2024-10-11 03:35:35,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-11 03:35:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1769 transitions. [2024-10-11 03:35:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:35:35,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:35,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:35,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:35:35,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:35,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:35,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1412156261, now seen corresponding path program 1 times [2024-10-11 03:35:35,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:35,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898281844] [2024-10-11 03:35:35,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:35,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:35,506 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-11 03:35:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:35,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898281844] [2024-10-11 03:35:35,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898281844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:35,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:35,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:35,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568045394] [2024-10-11 03:35:35,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:35,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:35,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:35,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:35,509 INFO L87 Difference]: Start difference. First operand 1062 states and 1769 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:35,567 INFO L93 Difference]: Finished difference Result 1968 states and 3283 transitions. [2024-10-11 03:35:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:35,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-11 03:35:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:35,575 INFO L225 Difference]: With dead ends: 1968 [2024-10-11 03:35:35,575 INFO L226 Difference]: Without dead ends: 1506 [2024-10-11 03:35:35,577 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-11 03:35:35,578 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 184 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1067 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-11 03:35:35,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1067 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-10-11 03:35:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1504. [2024-10-11 03:35:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 1.6640053226879574) internal successors, (2501), 1503 states have internal predecessors, (2501), 0 states have call successors, (0), 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-11 03:35:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2501 transitions. [2024-10-11 03:35:35,619 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2501 transitions. Word has length 107 [2024-10-11 03:35:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:35,620 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 2501 transitions. [2024-10-11 03:35:35,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2501 transitions. [2024-10-11 03:35:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:35:35,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:35,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:35,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:35:35,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:35,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2099416393, now seen corresponding path program 1 times [2024-10-11 03:35:35,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:35,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584948846] [2024-10-11 03:35:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:35,789 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-11 03:35:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:35,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584948846] [2024-10-11 03:35:35,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584948846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:35,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:35,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170198717] [2024-10-11 03:35:35,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:35,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:35,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:35,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:35,794 INFO L87 Difference]: Start difference. First operand 1504 states and 2501 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:35,843 INFO L93 Difference]: Finished difference Result 3880 states and 6427 transitions. [2024-10-11 03:35:35,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:35,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-11 03:35:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:35,856 INFO L225 Difference]: With dead ends: 3880 [2024-10-11 03:35:35,856 INFO L226 Difference]: Without dead ends: 2638 [2024-10-11 03:35:35,859 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-11 03:35:35,860 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 177 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:35,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1049 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:35,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2024-10-11 03:35:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2636. [2024-10-11 03:35:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.6504743833017077) internal successors, (4349), 2635 states have internal predecessors, (4349), 0 states have call successors, (0), 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-11 03:35:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 4349 transitions. [2024-10-11 03:35:35,924 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 4349 transitions. Word has length 107 [2024-10-11 03:35:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:35,925 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 4349 transitions. [2024-10-11 03:35:35,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 4349 transitions. [2024-10-11 03:35:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:35:35,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:35,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:35,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:35:35,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:35,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:35,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1560073493, now seen corresponding path program 1 times [2024-10-11 03:35:35,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:35,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425721230] [2024-10-11 03:35:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:36,134 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-11 03:35:36,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425721230] [2024-10-11 03:35:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425721230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:36,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:36,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262750092] [2024-10-11 03:35:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:36,138 INFO L87 Difference]: Start difference. First operand 2636 states and 4349 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-11 03:35:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:36,192 INFO L93 Difference]: Finished difference Result 4880 states and 8063 transitions. [2024-10-11 03:35:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:36,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-10-11 03:35:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:36,209 INFO L225 Difference]: With dead ends: 4880 [2024-10-11 03:35:36,210 INFO L226 Difference]: Without dead ends: 3638 [2024-10-11 03:35:36,216 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-11 03:35:36,217 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 178 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1040 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-11 03:35:36,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1040 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2024-10-11 03:35:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3636. [2024-10-11 03:35:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 3635 states have (on average 1.6453920220082532) internal successors, (5981), 3635 states have internal predecessors, (5981), 0 states have call successors, (0), 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-11 03:35:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5981 transitions. [2024-10-11 03:35:36,314 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5981 transitions. Word has length 110 [2024-10-11 03:35:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:36,314 INFO L471 AbstractCegarLoop]: Abstraction has 3636 states and 5981 transitions. [2024-10-11 03:35:36,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-11 03:35:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5981 transitions. [2024-10-11 03:35:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:35:36,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:36,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:36,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:35:36,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:36,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2001352775, now seen corresponding path program 1 times [2024-10-11 03:35:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:36,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691274286] [2024-10-11 03:35:36,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:36,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691274286] [2024-10-11 03:35:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691274286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:36,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:35:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060363062] [2024-10-11 03:35:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:36,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:35:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:35:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:35:36,611 INFO L87 Difference]: Start difference. First operand 3636 states and 5981 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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-11 03:35:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:37,069 INFO L93 Difference]: Finished difference Result 20390 states and 33848 transitions. [2024-10-11 03:35:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:35:37,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-10-11 03:35:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:37,139 INFO L225 Difference]: With dead ends: 20390 [2024-10-11 03:35:37,139 INFO L226 Difference]: Without dead ends: 17088 [2024-10-11 03:35:37,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:35:37,157 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 1812 mSDsluCounter, 3856 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:37,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1812 Valid, 4433 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:35:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17088 states. [2024-10-11 03:35:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17088 to 6867. [2024-10-11 03:35:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6867 states, 6866 states have (on average 1.6420040780658316) internal successors, (11274), 6866 states have internal predecessors, (11274), 0 states have call successors, (0), 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-11 03:35:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6867 states to 6867 states and 11274 transitions. [2024-10-11 03:35:37,439 INFO L78 Accepts]: Start accepts. Automaton has 6867 states and 11274 transitions. Word has length 110 [2024-10-11 03:35:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:37,439 INFO L471 AbstractCegarLoop]: Abstraction has 6867 states and 11274 transitions. [2024-10-11 03:35:37,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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-11 03:35:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6867 states and 11274 transitions. [2024-10-11 03:35:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 03:35:37,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:37,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:37,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:35:37,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1845331814, now seen corresponding path program 1 times [2024-10-11 03:35:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:37,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263633814] [2024-10-11 03:35:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:37,625 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-11 03:35:37,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:37,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263633814] [2024-10-11 03:35:37,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263633814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:37,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:37,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:37,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949324779] [2024-10-11 03:35:37,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:37,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:37,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:37,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:37,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:37,628 INFO L87 Difference]: Start difference. First operand 6867 states and 11274 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-11 03:35:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:37,802 INFO L93 Difference]: Finished difference Result 20224 states and 33449 transitions. [2024-10-11 03:35:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:37,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-11 03:35:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:37,844 INFO L225 Difference]: With dead ends: 20224 [2024-10-11 03:35:37,845 INFO L226 Difference]: Without dead ends: 13777 [2024-10-11 03:35:37,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:37,857 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 624 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:37,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1719 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13777 states. [2024-10-11 03:35:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13777 to 10318. [2024-10-11 03:35:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10318 states, 10317 states have (on average 1.6450518561597363) internal successors, (16972), 10317 states have internal predecessors, (16972), 0 states have call successors, (0), 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-11 03:35:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10318 states to 10318 states and 16972 transitions. [2024-10-11 03:35:38,091 INFO L78 Accepts]: Start accepts. Automaton has 10318 states and 16972 transitions. Word has length 111 [2024-10-11 03:35:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:38,091 INFO L471 AbstractCegarLoop]: Abstraction has 10318 states and 16972 transitions. [2024-10-11 03:35:38,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-11 03:35:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 10318 states and 16972 transitions. [2024-10-11 03:35:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 03:35:38,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:38,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:38,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:35:38,095 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:38,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1599790197, now seen corresponding path program 1 times [2024-10-11 03:35:38,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:38,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535132300] [2024-10-11 03:35:38,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:38,215 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-11 03:35:38,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:38,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535132300] [2024-10-11 03:35:38,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535132300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:38,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:38,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030472984] [2024-10-11 03:35:38,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:38,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:38,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:38,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:38,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:38,219 INFO L87 Difference]: Start difference. First operand 10318 states and 16972 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-11 03:35:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:38,297 INFO L93 Difference]: Finished difference Result 19394 states and 32022 transitions. [2024-10-11 03:35:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:38,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-11 03:35:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:38,331 INFO L225 Difference]: With dead ends: 19394 [2024-10-11 03:35:38,332 INFO L226 Difference]: Without dead ends: 14002 [2024-10-11 03:35:38,345 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-11 03:35:38,347 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 190 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1111 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-11 03:35:38,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1111 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14002 states. [2024-10-11 03:35:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14002 to 14000. [2024-10-11 03:35:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14000 states, 13999 states have (on average 1.6438317022644475) internal successors, (23012), 13999 states have internal predecessors, (23012), 0 states have call successors, (0), 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-11 03:35:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14000 states to 14000 states and 23012 transitions. [2024-10-11 03:35:38,637 INFO L78 Accepts]: Start accepts. Automaton has 14000 states and 23012 transitions. Word has length 111 [2024-10-11 03:35:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:38,637 INFO L471 AbstractCegarLoop]: Abstraction has 14000 states and 23012 transitions. [2024-10-11 03:35:38,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-11 03:35:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 14000 states and 23012 transitions. [2024-10-11 03:35:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 03:35:38,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:38,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:38,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:35:38,640 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:38,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash -157389061, now seen corresponding path program 1 times [2024-10-11 03:35:38,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:38,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132254079] [2024-10-11 03:35:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:38,769 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-11 03:35:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132254079] [2024-10-11 03:35:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132254079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65451880] [2024-10-11 03:35:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:38,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:38,772 INFO L87 Difference]: Start difference. First operand 14000 states and 23012 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-11 03:35:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:38,908 INFO L93 Difference]: Finished difference Result 30413 states and 50388 transitions. [2024-10-11 03:35:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-11 03:35:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:38,956 INFO L225 Difference]: With dead ends: 30413 [2024-10-11 03:35:38,956 INFO L226 Difference]: Without dead ends: 20720 [2024-10-11 03:35:38,979 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-11 03:35:38,980 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 196 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1146 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-11 03:35:38,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20720 states. [2024-10-11 03:35:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20720 to 20718. [2024-10-11 03:35:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20718 states, 20717 states have (on average 1.6462808321668194) internal successors, (34106), 20717 states have internal predecessors, (34106), 0 states have call successors, (0), 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-11 03:35:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20718 states to 20718 states and 34106 transitions. [2024-10-11 03:35:39,447 INFO L78 Accepts]: Start accepts. Automaton has 20718 states and 34106 transitions. Word has length 111 [2024-10-11 03:35:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 20718 states and 34106 transitions. [2024-10-11 03:35:39,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-11 03:35:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 20718 states and 34106 transitions. [2024-10-11 03:35:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:35:39,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:39,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:39,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:35:39,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:39,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1308207342, now seen corresponding path program 1 times [2024-10-11 03:35:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301711782] [2024-10-11 03:35:39,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:39,802 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-11 03:35:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301711782] [2024-10-11 03:35:39,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301711782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:39,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:39,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826044685] [2024-10-11 03:35:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:39,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:39,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:39,805 INFO L87 Difference]: Start difference. First operand 20718 states and 34106 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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-11 03:35:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:40,110 INFO L93 Difference]: Finished difference Result 67416 states and 111245 transitions. [2024-10-11 03:35:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:40,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-10-11 03:35:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:40,228 INFO L225 Difference]: With dead ends: 67416 [2024-10-11 03:35:40,228 INFO L226 Difference]: Without dead ends: 46930 [2024-10-11 03:35:40,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:40,275 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 622 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:40,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1573 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46930 states. [2024-10-11 03:35:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46930 to 33735. [2024-10-11 03:35:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33735 states, 33734 states have (on average 1.6415485859963241) internal successors, (55376), 33734 states have internal predecessors, (55376), 0 states have call successors, (0), 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-11 03:35:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33735 states to 33735 states and 55376 transitions. [2024-10-11 03:35:41,108 INFO L78 Accepts]: Start accepts. Automaton has 33735 states and 55376 transitions. Word has length 112 [2024-10-11 03:35:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:41,109 INFO L471 AbstractCegarLoop]: Abstraction has 33735 states and 55376 transitions. [2024-10-11 03:35:41,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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-11 03:35:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 33735 states and 55376 transitions. [2024-10-11 03:35:41,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:35:41,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:41,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:41,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:35:41,111 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:41,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1841775917, now seen corresponding path program 1 times [2024-10-11 03:35:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246076535] [2024-10-11 03:35:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:41,471 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-11 03:35:41,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:41,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246076535] [2024-10-11 03:35:41,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246076535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:41,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:41,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:41,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257383091] [2024-10-11 03:35:41,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:41,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:41,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:41,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:41,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:41,474 INFO L87 Difference]: Start difference. First operand 33735 states and 55376 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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-11 03:35:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:41,918 INFO L93 Difference]: Finished difference Result 109310 states and 179861 transitions. [2024-10-11 03:35:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:41,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-11 03:35:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:42,104 INFO L225 Difference]: With dead ends: 109310 [2024-10-11 03:35:42,105 INFO L226 Difference]: Without dead ends: 75807 [2024-10-11 03:35:42,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:42,176 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 620 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:42,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1620 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75807 states. [2024-10-11 03:35:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75807 to 54628. [2024-10-11 03:35:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54628 states, 54627 states have (on average 1.6368096362604574) internal successors, (89414), 54627 states have internal predecessors, (89414), 0 states have call successors, (0), 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-11 03:35:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54628 states to 54628 states and 89414 transitions. [2024-10-11 03:35:43,747 INFO L78 Accepts]: Start accepts. Automaton has 54628 states and 89414 transitions. Word has length 113 [2024-10-11 03:35:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:43,748 INFO L471 AbstractCegarLoop]: Abstraction has 54628 states and 89414 transitions. [2024-10-11 03:35:43,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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-11 03:35:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 54628 states and 89414 transitions. [2024-10-11 03:35:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:35:43,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:43,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:43,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:35:43,750 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:43,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1207090581, now seen corresponding path program 1 times [2024-10-11 03:35:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:43,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106789976] [2024-10-11 03:35:43,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:43,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:43,904 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-11 03:35:43,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:43,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106789976] [2024-10-11 03:35:43,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106789976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:43,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:43,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:43,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601294704] [2024-10-11 03:35:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:43,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:43,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:43,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:43,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:43,907 INFO L87 Difference]: Start difference. First operand 54628 states and 89414 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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-11 03:35:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:44,884 INFO L93 Difference]: Finished difference Result 175036 states and 287173 transitions. [2024-10-11 03:35:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:44,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-10-11 03:35:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:45,266 INFO L225 Difference]: With dead ends: 175036 [2024-10-11 03:35:45,267 INFO L226 Difference]: Without dead ends: 120640 [2024-10-11 03:35:45,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:45,333 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 618 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:45,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1685 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120640 states. [2024-10-11 03:35:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120640 to 87409. [2024-10-11 03:35:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87409 states, 87408 states have (on average 1.632116053450485) internal successors, (142660), 87408 states have internal predecessors, (142660), 0 states have call successors, (0), 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-11 03:35:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87409 states to 87409 states and 142660 transitions. [2024-10-11 03:35:47,231 INFO L78 Accepts]: Start accepts. Automaton has 87409 states and 142660 transitions. Word has length 114 [2024-10-11 03:35:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:47,232 INFO L471 AbstractCegarLoop]: Abstraction has 87409 states and 142660 transitions. [2024-10-11 03:35:47,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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-11 03:35:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 87409 states and 142660 transitions. [2024-10-11 03:35:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 03:35:47,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:47,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:47,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:35:47,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:47,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1144428250, now seen corresponding path program 1 times [2024-10-11 03:35:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79378754] [2024-10-11 03:35:47,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:47,591 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-11 03:35:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79378754] [2024-10-11 03:35:47,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79378754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:47,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:47,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:35:47,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935129250] [2024-10-11 03:35:47,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:47,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:35:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:35:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:35:47,594 INFO L87 Difference]: Start difference. First operand 87409 states and 142660 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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-11 03:35:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:48,628 INFO L93 Difference]: Finished difference Result 174588 states and 284942 transitions. [2024-10-11 03:35:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:35:48,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-11 03:35:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:48,813 INFO L225 Difference]: With dead ends: 174588 [2024-10-11 03:35:48,813 INFO L226 Difference]: Without dead ends: 87411 [2024-10-11 03:35:48,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:35:48,861 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 534 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:48,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1943 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87411 states. [2024-10-11 03:35:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87411 to 87409. [2024-10-11 03:35:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87409 states, 87408 states have (on average 1.6249656781987918) internal successors, (142035), 87408 states have internal predecessors, (142035), 0 states have call successors, (0), 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-11 03:35:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87409 states to 87409 states and 142035 transitions. [2024-10-11 03:35:50,237 INFO L78 Accepts]: Start accepts. Automaton has 87409 states and 142035 transitions. Word has length 116 [2024-10-11 03:35:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:50,238 INFO L471 AbstractCegarLoop]: Abstraction has 87409 states and 142035 transitions. [2024-10-11 03:35:50,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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-11 03:35:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 87409 states and 142035 transitions. [2024-10-11 03:35:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 03:35:50,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:50,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:35:50,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2034961951, now seen corresponding path program 1 times [2024-10-11 03:35:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:50,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377642737] [2024-10-11 03:35:50,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:50,652 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-11 03:35:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377642737] [2024-10-11 03:35:50,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377642737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:50,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:50,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:35:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165215865] [2024-10-11 03:35:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:50,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:35:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:50,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:35:50,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:35:50,655 INFO L87 Difference]: Start difference. First operand 87409 states and 142035 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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-11 03:35:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:51,882 INFO L93 Difference]: Finished difference Result 255482 states and 415610 transitions. [2024-10-11 03:35:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:35:51,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-11 03:35:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:52,191 INFO L225 Difference]: With dead ends: 255482 [2024-10-11 03:35:52,191 INFO L226 Difference]: Without dead ends: 168305 [2024-10-11 03:35:52,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:35:52,295 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 528 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:52,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1958 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168305 states. [2024-10-11 03:35:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168305 to 168303. [2024-10-11 03:35:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168303 states, 168302 states have (on average 1.6157621418640302) internal successors, (271936), 168302 states have internal predecessors, (271936), 0 states have call successors, (0), 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-11 03:35:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168303 states to 168303 states and 271936 transitions. [2024-10-11 03:35:55,621 INFO L78 Accepts]: Start accepts. Automaton has 168303 states and 271936 transitions. Word has length 119 [2024-10-11 03:35:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:55,622 INFO L471 AbstractCegarLoop]: Abstraction has 168303 states and 271936 transitions. [2024-10-11 03:35:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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-11 03:35:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 168303 states and 271936 transitions. [2024-10-11 03:35:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 03:35:55,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:55,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:55,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:35:55,628 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:55,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1342598109, now seen corresponding path program 1 times [2024-10-11 03:35:55,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995722027] [2024-10-11 03:35:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:56,490 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-11 03:35:56,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:56,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995722027] [2024-10-11 03:35:56,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995722027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:35:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052787828] [2024-10-11 03:35:56,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:56,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:35:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:56,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:35:56,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:56,495 INFO L87 Difference]: Start difference. First operand 168303 states and 271936 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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-11 03:35:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:57,201 INFO L93 Difference]: Finished difference Result 172177 states and 277745 transitions. [2024-10-11 03:35:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:57,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-10-11 03:35:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:57,544 INFO L225 Difference]: With dead ends: 172177 [2024-10-11 03:35:57,544 INFO L226 Difference]: Without dead ends: 172175 [2024-10-11 03:35:57,610 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-11 03:35:57,611 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 0 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:57,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2017 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172175 states. [2024-10-11 03:35:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172175 to 172175. [2024-10-11 03:36:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172175 states, 172174 states have (on average 1.6017575243648867) internal successors, (275781), 172174 states have internal predecessors, (275781), 0 states have call successors, (0), 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-11 03:36:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172175 states to 172175 states and 275781 transitions. [2024-10-11 03:36:00,352 INFO L78 Accepts]: Start accepts. Automaton has 172175 states and 275781 transitions. Word has length 120 [2024-10-11 03:36:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:00,353 INFO L471 AbstractCegarLoop]: Abstraction has 172175 states and 275781 transitions. [2024-10-11 03:36:00,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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-11 03:36:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 172175 states and 275781 transitions. [2024-10-11 03:36:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:36:00,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:00,362 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:36:00,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:36:00,362 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:36:00,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash -893941710, now seen corresponding path program 1 times [2024-10-11 03:36:00,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:00,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442650050] [2024-10-11 03:36:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:36:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442650050] [2024-10-11 03:36:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442650050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:01,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:01,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:36:01,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390735486] [2024-10-11 03:36:01,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:01,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:36:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:01,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:36:01,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:36:01,337 INFO L87 Difference]: Start difference. First operand 172175 states and 275781 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-11 03:36:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:03,747 INFO L93 Difference]: Finished difference Result 469201 states and 754034 transitions. [2024-10-11 03:36:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:36:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 150 [2024-10-11 03:36:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:04,690 INFO L225 Difference]: With dead ends: 469201 [2024-10-11 03:36:04,691 INFO L226 Difference]: Without dead ends: 393549 [2024-10-11 03:36:04,782 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-11 03:36:04,782 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 1405 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:04,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 2548 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:36:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393549 states. [2024-10-11 03:36:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393549 to 276607. [2024-10-11 03:36:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276607 states, 276606 states have (on average 1.6001207493691387) internal successors, (442603), 276606 states have internal predecessors, (442603), 0 states have call successors, (0), 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-11 03:36:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276607 states to 276607 states and 442603 transitions. [2024-10-11 03:36:09,893 INFO L78 Accepts]: Start accepts. Automaton has 276607 states and 442603 transitions. Word has length 150 [2024-10-11 03:36:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:09,894 INFO L471 AbstractCegarLoop]: Abstraction has 276607 states and 442603 transitions. [2024-10-11 03:36:09,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-11 03:36:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 276607 states and 442603 transitions. [2024-10-11 03:36:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:36:09,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:09,902 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:36:09,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:36:09,902 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:36:09,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash -652269282, now seen corresponding path program 1 times [2024-10-11 03:36:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:09,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842845102] [2024-10-11 03:36:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:36:11,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:11,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842845102] [2024-10-11 03:36:11,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842845102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:11,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:11,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:36:11,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701798571] [2024-10-11 03:36:11,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:11,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:36:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:11,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:36:11,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:36:11,422 INFO L87 Difference]: Start difference. First operand 276607 states and 442603 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-11 03:36:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:13,937 INFO L93 Difference]: Finished difference Result 499221 states and 802374 transitions. [2024-10-11 03:36:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:36:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 150 [2024-10-11 03:36:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:14,982 INFO L225 Difference]: With dead ends: 499221 [2024-10-11 03:36:14,983 INFO L226 Difference]: Without dead ends: 423569 [2024-10-11 03:36:15,136 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-11 03:36:15,137 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1277 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:15,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2671 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:36:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423569 states. [2024-10-11 03:36:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423569 to 373873. [2024-10-11 03:36:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373873 states, 373872 states have (on average 1.6012458809432104) internal successors, (598661), 373872 states have internal predecessors, (598661), 0 states have call successors, (0), 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-11 03:36:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373873 states to 373873 states and 598661 transitions. [2024-10-11 03:36:22,290 INFO L78 Accepts]: Start accepts. Automaton has 373873 states and 598661 transitions. Word has length 150 [2024-10-11 03:36:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:22,290 INFO L471 AbstractCegarLoop]: Abstraction has 373873 states and 598661 transitions. [2024-10-11 03:36:22,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-11 03:36:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 373873 states and 598661 transitions. [2024-10-11 03:36:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:36:22,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:22,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:36:22,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:36:22,296 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:36:22,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1693206396, now seen corresponding path program 1 times [2024-10-11 03:36:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:22,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189129132] [2024-10-11 03:36:22,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:22,549 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-11 03:36:22,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:22,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189129132] [2024-10-11 03:36:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189129132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:36:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090276300] [2024-10-11 03:36:22,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:22,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:36:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:22,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:36:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:36:22,553 INFO L87 Difference]: Start difference. First operand 373873 states and 598661 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 03:36:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:25,130 INFO L93 Difference]: Finished difference Result 547349 states and 880002 transitions. [2024-10-11 03:36:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:36:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 150 [2024-10-11 03:36:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:26,157 INFO L225 Difference]: With dead ends: 547349 [2024-10-11 03:36:26,157 INFO L226 Difference]: Without dead ends: 471697 [2024-10-11 03:36:26,335 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-11 03:36:26,335 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 1303 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:26,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 3084 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]