./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label51.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/eca-rers2012/Problem12_label51.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 c7d97141912edf4d560524a4fad707a432ae86320ba1bcf5df7fccfaf2185109 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:25:01,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:25:01,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:25:01,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:25:01,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:25:01,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:25:01,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:25:01,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:25:01,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:25:01,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:25:01,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:25:01,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:25:01,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:25:01,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:25:01,645 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:25:01,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:25:01,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:25:01,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:25:01,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:25:01,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:25:01,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:25:01,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:25:01,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:25:01,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:25:01,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:25:01,654 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:25:01,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:25:01,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:25:01,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:25:01,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:25:01,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:25:01,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:25:01,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:25:01,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:25:01,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:25:01,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:25:01,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:25:01,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:25:01,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:25:01,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:25:01,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:25:01,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:25:01,661 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 -> c7d97141912edf4d560524a4fad707a432ae86320ba1bcf5df7fccfaf2185109 [2024-10-10 23:25:01,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:25:01,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:25:01,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:25:01,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:25:01,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:25:01,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label51.c [2024-10-10 23:25:03,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:25:03,890 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:25:03,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label51.c [2024-10-10 23:25:03,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/063a37386/933d9551409e4eb1bc7c416eaca3fcda/FLAG5d35ac39d [2024-10-10 23:25:04,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/063a37386/933d9551409e4eb1bc7c416eaca3fcda [2024-10-10 23:25:04,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:25:04,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:25:04,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:25:04,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:25:04,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:25:04,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:04" (1/1) ... [2024-10-10 23:25:04,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f6c965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:04, skipping insertion in model container [2024-10-10 23:25:04,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:04" (1/1) ... [2024-10-10 23:25:04,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:25:04,444 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label51.c[1794,1807] [2024-10-10 23:25:05,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:25:05,254 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:25:05,270 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label51.c[1794,1807] [2024-10-10 23:25:05,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:25:05,755 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:25:05,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05 WrapperNode [2024-10-10 23:25:05,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:25:05,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:25:05,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:25:05,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:25:05,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:05,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,193 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:25:06,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:25:06,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:25:06,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:25:06,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:25:06,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,414 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-10 23:25:06,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:25:06,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:25:06,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:25:06,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:25:06,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (1/1) ... [2024-10-10 23:25:06,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:25:06,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:25:06,738 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-10 23:25:06,740 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-10 23:25:06,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:25:06,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:25:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:25:06,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:25:06,874 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:25:06,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:25:11,372 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:25:11,373 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:25:11,464 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:25:11,465 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:25:11,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:11 BoogieIcfgContainer [2024-10-10 23:25:11,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:25:11,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:25:11,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:25:11,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:25:11,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:25:04" (1/3) ... [2024-10-10 23:25:11,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a3c567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:11, skipping insertion in model container [2024-10-10 23:25:11,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:05" (2/3) ... [2024-10-10 23:25:11,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a3c567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:11, skipping insertion in model container [2024-10-10 23:25:11,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:11" (3/3) ... [2024-10-10 23:25:11,475 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label51.c [2024-10-10 23:25:11,492 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:25:11,492 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:25:11,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:25:11,599 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;@780823a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:25:11,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:25:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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-10 23:25:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 23:25:11,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:11,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:11,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:11,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2073970864, now seen corresponding path program 1 times [2024-10-10 23:25:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:11,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944945834] [2024-10-10 23:25:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:11,796 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-10 23:25:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:11,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944945834] [2024-10-10 23:25:11,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944945834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:11,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:11,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:25:11,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724866037] [2024-10-10 23:25:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:11,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:25:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:11,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:25:11,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:25:11,836 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-10 23:25:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:11,931 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:25:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:25:11,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-10 23:25:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:11,964 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:25:11,965 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:25:11,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:25:11,974 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:11,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:25:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:25:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:25:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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-10 23:25:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:25:12,065 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 10 [2024-10-10 23:25:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:12,066 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:25:12,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-10 23:25:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:25:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 23:25:12,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:12,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:12,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:25:12,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:12,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash 801188802, now seen corresponding path program 1 times [2024-10-10 23:25:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:12,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717527684] [2024-10-10 23:25:12,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:12,307 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-10 23:25:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:12,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717527684] [2024-10-10 23:25:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717527684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:12,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:12,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847770866] [2024-10-10 23:25:12,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:12,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:25:12,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:12,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:25:12,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:25:12,313 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-10 23:25:17,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:17,583 INFO L93 Difference]: Finished difference Result 3017 states and 5755 transitions. [2024-10-10 23:25:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:25:17,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-10 23:25:17,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:17,597 INFO L225 Difference]: With dead ends: 3017 [2024-10-10 23:25:17,597 INFO L226 Difference]: Without dead ends: 2264 [2024-10-10 23:25:17,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10 23:25:17,600 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 2421 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 1596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1596 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:17,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2421 Valid, 197 Invalid, 5209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1596 Valid, 3613 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-10 23:25:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-10-10 23:25:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2256. [2024-10-10 23:25:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5352549889135254) internal successors, (3462), 2255 states have internal predecessors, (3462), 0 states have call successors, (0), 0 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-10 23:25:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3462 transitions. [2024-10-10 23:25:17,708 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3462 transitions. Word has length 10 [2024-10-10 23:25:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:17,708 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3462 transitions. [2024-10-10 23:25:17,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-10 23:25:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3462 transitions. [2024-10-10 23:25:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-10 23:25:17,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:17,716 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:17,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:25:17,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:17,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash -199318755, now seen corresponding path program 1 times [2024-10-10 23:25:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442385582] [2024-10-10 23:25:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:25:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442385582] [2024-10-10 23:25:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442385582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:18,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503628675] [2024-10-10 23:25:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:18,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:25:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:18,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:25:18,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:25:18,281 INFO L87 Difference]: Start difference. First operand 2256 states and 3462 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-10 23:25:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:21,931 INFO L93 Difference]: Finished difference Result 6050 states and 9663 transitions. [2024-10-10 23:25:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:25:21,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-10 23:25:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:21,945 INFO L225 Difference]: With dead ends: 6050 [2024-10-10 23:25:21,945 INFO L226 Difference]: Without dead ends: 3758 [2024-10-10 23:25:21,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:25:21,949 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 702 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:21,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 705 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:25:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-10-10 23:25:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3758. [2024-10-10 23:25:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.340963534735161) internal successors, (5038), 3757 states have internal predecessors, (5038), 0 states have call successors, (0), 0 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-10 23:25:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 5038 transitions. [2024-10-10 23:25:22,011 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 5038 transitions. Word has length 150 [2024-10-10 23:25:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:22,013 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 5038 transitions. [2024-10-10 23:25:22,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-10 23:25:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 5038 transitions. [2024-10-10 23:25:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-10 23:25:22,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:22,025 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:22,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:25:22,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:22,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1865389074, now seen corresponding path program 1 times [2024-10-10 23:25:22,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:22,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767732809] [2024-10-10 23:25:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:25:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767732809] [2024-10-10 23:25:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767732809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:25:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002127994] [2024-10-10 23:25:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:22,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:22,302 INFO L87 Difference]: Start difference. First operand 3758 states and 5038 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-10 23:25:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:24,847 INFO L93 Difference]: Finished difference Result 10519 states and 14355 transitions. [2024-10-10 23:25:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 220 [2024-10-10 23:25:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:24,874 INFO L225 Difference]: With dead ends: 10519 [2024-10-10 23:25:24,874 INFO L226 Difference]: Without dead ends: 6762 [2024-10-10 23:25:24,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:24,881 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:24,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 484 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:25:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-10 23:25:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6011. [2024-10-10 23:25:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 1.2815307820299502) internal successors, (7702), 6010 states have internal predecessors, (7702), 0 states have call successors, (0), 0 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-10 23:25:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 7702 transitions. [2024-10-10 23:25:25,012 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 7702 transitions. Word has length 220 [2024-10-10 23:25:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:25,014 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 7702 transitions. [2024-10-10 23:25:25,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-10 23:25:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 7702 transitions. [2024-10-10 23:25:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-10 23:25:25,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:25,022 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:25,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:25:25,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:25,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1957514575, now seen corresponding path program 1 times [2024-10-10 23:25:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:25,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488454944] [2024-10-10 23:25:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-10 23:25:25,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:25,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488454944] [2024-10-10 23:25:25,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488454944] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:25:25,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191457508] [2024-10-10 23:25:25,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:25,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:25:25,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:25:25,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:25:25,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:25:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:25,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:25:25,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:25:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:25:25,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:25:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191457508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:25,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:25:25,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:25:25,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902755107] [2024-10-10 23:25:25,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:25,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:25,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:25,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:25:25,892 INFO L87 Difference]: Start difference. First operand 6011 states and 7702 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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-10 23:25:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:28,509 INFO L93 Difference]: Finished difference Result 15025 states and 19933 transitions. [2024-10-10 23:25:28,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:28,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2024-10-10 23:25:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:28,540 INFO L225 Difference]: With dead ends: 15025 [2024-10-10 23:25:28,540 INFO L226 Difference]: Without dead ends: 9015 [2024-10-10 23:25:28,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:25:28,549 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 907 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2073 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:28,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 307 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2073 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:25:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9015 states. [2024-10-10 23:25:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9015 to 9015. [2024-10-10 23:25:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9015 states, 9014 states have (on average 1.265808741956956) internal successors, (11410), 9014 states have internal predecessors, (11410), 0 states have call successors, (0), 0 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-10 23:25:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9015 states to 9015 states and 11410 transitions. [2024-10-10 23:25:28,701 INFO L78 Accepts]: Start accepts. Automaton has 9015 states and 11410 transitions. Word has length 233 [2024-10-10 23:25:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:28,703 INFO L471 AbstractCegarLoop]: Abstraction has 9015 states and 11410 transitions. [2024-10-10 23:25:28,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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-10 23:25:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 9015 states and 11410 transitions. [2024-10-10 23:25:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-10 23:25:28,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:28,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:28,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:25:28,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:25:28,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:28,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1700355033, now seen corresponding path program 1 times [2024-10-10 23:25:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:28,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507583581] [2024-10-10 23:25:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-10 23:25:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507583581] [2024-10-10 23:25:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507583581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:29,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:29,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907035901] [2024-10-10 23:25:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:29,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:29,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:29,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:29,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:29,167 INFO L87 Difference]: Start difference. First operand 9015 states and 11410 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-10 23:25:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:31,740 INFO L93 Difference]: Finished difference Result 21784 states and 27826 transitions. [2024-10-10 23:25:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:31,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 250 [2024-10-10 23:25:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:31,782 INFO L225 Difference]: With dead ends: 21784 [2024-10-10 23:25:31,782 INFO L226 Difference]: Without dead ends: 12770 [2024-10-10 23:25:31,796 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-10 23:25:31,797 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 764 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:31,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1213 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:25:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2024-10-10 23:25:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 12770. [2024-10-10 23:25:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12770 states, 12769 states have (on average 1.1838828412561673) internal successors, (15117), 12769 states have internal predecessors, (15117), 0 states have call successors, (0), 0 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-10 23:25:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12770 states to 12770 states and 15117 transitions. [2024-10-10 23:25:32,103 INFO L78 Accepts]: Start accepts. Automaton has 12770 states and 15117 transitions. Word has length 250 [2024-10-10 23:25:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:32,103 INFO L471 AbstractCegarLoop]: Abstraction has 12770 states and 15117 transitions. [2024-10-10 23:25:32,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-10 23:25:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 12770 states and 15117 transitions. [2024-10-10 23:25:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-10 23:25:32,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:32,110 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-10 23:25:32,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:25:32,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:32,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1656183337, now seen corresponding path program 1 times [2024-10-10 23:25:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:32,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888283461] [2024-10-10 23:25:32,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 23:25:32,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:32,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888283461] [2024-10-10 23:25:32,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888283461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:32,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:32,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:32,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842502938] [2024-10-10 23:25:32,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:32,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:32,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:32,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:32,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:32,419 INFO L87 Difference]: Start difference. First operand 12770 states and 15117 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-10 23:25:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:35,138 INFO L93 Difference]: Finished difference Result 36053 states and 43061 transitions. [2024-10-10 23:25:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 337 [2024-10-10 23:25:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:35,181 INFO L225 Difference]: With dead ends: 36053 [2024-10-10 23:25:35,181 INFO L226 Difference]: Without dead ends: 23284 [2024-10-10 23:25:35,200 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-10 23:25:35,201 INFO L432 NwaCegarLoop]: 1213 mSDtfsCounter, 639 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:35,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1220 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:25:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23284 states. [2024-10-10 23:25:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23284 to 22533. [2024-10-10 23:25:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.172022013136872) internal successors, (26408), 22532 states have internal predecessors, (26408), 0 states have call successors, (0), 0 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-10 23:25:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 26408 transitions. [2024-10-10 23:25:35,579 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 26408 transitions. Word has length 337 [2024-10-10 23:25:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:35,580 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 26408 transitions. [2024-10-10 23:25:35,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-10 23:25:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 26408 transitions. [2024-10-10 23:25:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-10 23:25:35,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:35,585 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:35,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:25:35,586 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:35,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:35,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2060832013, now seen corresponding path program 1 times [2024-10-10 23:25:35,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:35,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538150964] [2024-10-10 23:25:35,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:35,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:25:35,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:35,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538150964] [2024-10-10 23:25:35,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538150964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:35,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:35,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321765564] [2024-10-10 23:25:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:35,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:35,856 INFO L87 Difference]: Start difference. First operand 22533 states and 26408 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-10 23:25:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:38,211 INFO L93 Difference]: Finished difference Result 51073 states and 59607 transitions. [2024-10-10 23:25:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:38,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 341 [2024-10-10 23:25:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:38,265 INFO L225 Difference]: With dead ends: 51073 [2024-10-10 23:25:38,266 INFO L226 Difference]: Without dead ends: 25537 [2024-10-10 23:25:38,295 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-10 23:25:38,296 INFO L432 NwaCegarLoop]: 1377 mSDtfsCounter, 756 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:38,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1384 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:25:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25537 states. [2024-10-10 23:25:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25537 to 25537. [2024-10-10 23:25:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25537 states, 25536 states have (on average 1.1246867167919798) internal successors, (28720), 25536 states have internal predecessors, (28720), 0 states have call successors, (0), 0 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-10 23:25:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25537 states to 25537 states and 28720 transitions. [2024-10-10 23:25:38,872 INFO L78 Accepts]: Start accepts. Automaton has 25537 states and 28720 transitions. Word has length 341 [2024-10-10 23:25:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:38,874 INFO L471 AbstractCegarLoop]: Abstraction has 25537 states and 28720 transitions. [2024-10-10 23:25:38,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-10 23:25:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 25537 states and 28720 transitions. [2024-10-10 23:25:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-10-10 23:25:38,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:38,884 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:38,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:25:38,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:38,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash -802907321, now seen corresponding path program 1 times [2024-10-10 23:25:38,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:38,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101952488] [2024-10-10 23:25:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:38,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-10 23:25:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101952488] [2024-10-10 23:25:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101952488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:39,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:39,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899049687] [2024-10-10 23:25:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:39,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:39,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:39,167 INFO L87 Difference]: Start difference. First operand 25537 states and 28720 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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-10 23:25:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:41,478 INFO L93 Difference]: Finished difference Result 51073 states and 57439 transitions. [2024-10-10 23:25:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 371 [2024-10-10 23:25:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:41,522 INFO L225 Difference]: With dead ends: 51073 [2024-10-10 23:25:41,522 INFO L226 Difference]: Without dead ends: 25537 [2024-10-10 23:25:41,547 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-10 23:25:41,548 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 721 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:41,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 201 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:25:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25537 states. [2024-10-10 23:25:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25537 to 25537. [2024-10-10 23:25:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25537 states, 25536 states have (on average 1.115875626566416) internal successors, (28495), 25536 states have internal predecessors, (28495), 0 states have call successors, (0), 0 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-10 23:25:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25537 states to 25537 states and 28495 transitions. [2024-10-10 23:25:41,992 INFO L78 Accepts]: Start accepts. Automaton has 25537 states and 28495 transitions. Word has length 371 [2024-10-10 23:25:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:41,993 INFO L471 AbstractCegarLoop]: Abstraction has 25537 states and 28495 transitions. [2024-10-10 23:25:41,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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-10 23:25:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 25537 states and 28495 transitions. [2024-10-10 23:25:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-10 23:25:42,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:42,001 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:25:42,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:25:42,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:42,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1962261527, now seen corresponding path program 1 times [2024-10-10 23:25:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:42,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352421495] [2024-10-10 23:25:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-10 23:25:42,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352421495] [2024-10-10 23:25:42,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352421495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:42,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:42,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:42,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058005927] [2024-10-10 23:25:42,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:42,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:42,257 INFO L87 Difference]: Start difference. First operand 25537 states and 28495 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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-10 23:25:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:44,716 INFO L93 Difference]: Finished difference Result 69097 states and 77627 transitions. [2024-10-10 23:25:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:44,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 382 [2024-10-10 23:25:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:44,768 INFO L225 Difference]: With dead ends: 69097 [2024-10-10 23:25:44,768 INFO L226 Difference]: Without dead ends: 43561 [2024-10-10 23:25:44,794 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-10 23:25:44,795 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 687 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:44,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 438 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:25:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43561 states. [2024-10-10 23:25:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43561 to 43561. [2024-10-10 23:25:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43561 states, 43560 states have (on average 1.1054866850321396) internal successors, (48155), 43560 states have internal predecessors, (48155), 0 states have call successors, (0), 0 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-10 23:25:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43561 states to 43561 states and 48155 transitions. [2024-10-10 23:25:45,376 INFO L78 Accepts]: Start accepts. Automaton has 43561 states and 48155 transitions. Word has length 382 [2024-10-10 23:25:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:45,377 INFO L471 AbstractCegarLoop]: Abstraction has 43561 states and 48155 transitions. [2024-10-10 23:25:45,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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-10 23:25:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 43561 states and 48155 transitions. [2024-10-10 23:25:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-10 23:25:45,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:45,384 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:45,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:25:45,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:45,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1229903748, now seen corresponding path program 1 times [2024-10-10 23:25:45,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:45,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142626314] [2024-10-10 23:25:45,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:45,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-10-10 23:25:45,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:45,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142626314] [2024-10-10 23:25:45,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142626314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:45,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406039128] [2024-10-10 23:25:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:45,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:45,807 INFO L87 Difference]: Start difference. First operand 43561 states and 48155 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-10 23:25:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:48,400 INFO L93 Difference]: Finished difference Result 101390 states and 112293 transitions. [2024-10-10 23:25:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:48,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 409 [2024-10-10 23:25:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:48,469 INFO L225 Difference]: With dead ends: 101390 [2024-10-10 23:25:48,470 INFO L226 Difference]: Without dead ends: 57830 [2024-10-10 23:25:48,498 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-10 23:25:48,498 INFO L432 NwaCegarLoop]: 1171 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:48,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1178 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:25:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57830 states. [2024-10-10 23:25:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57830 to 56328. [2024-10-10 23:25:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56328 states, 56327 states have (on average 1.0877199211745698) internal successors, (61268), 56327 states have internal predecessors, (61268), 0 states have call successors, (0), 0 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-10 23:25:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56328 states to 56328 states and 61268 transitions. [2024-10-10 23:25:49,037 INFO L78 Accepts]: Start accepts. Automaton has 56328 states and 61268 transitions. Word has length 409 [2024-10-10 23:25:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:49,038 INFO L471 AbstractCegarLoop]: Abstraction has 56328 states and 61268 transitions. [2024-10-10 23:25:49,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-10 23:25:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 56328 states and 61268 transitions. [2024-10-10 23:25:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-10-10 23:25:49,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:49,048 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:49,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:25:49,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:49,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash -356016128, now seen corresponding path program 1 times [2024-10-10 23:25:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:49,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273477277] [2024-10-10 23:25:49,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-10 23:25:49,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:49,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273477277] [2024-10-10 23:25:49,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273477277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:49,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:49,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:49,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998482445] [2024-10-10 23:25:49,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:49,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:49,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:49,708 INFO L87 Difference]: Start difference. First operand 56328 states and 61268 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:52,313 INFO L93 Difference]: Finished difference Result 135936 states and 147475 transitions. [2024-10-10 23:25:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:52,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481 [2024-10-10 23:25:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:52,427 INFO L225 Difference]: With dead ends: 135936 [2024-10-10 23:25:52,427 INFO L226 Difference]: Without dead ends: 79609 [2024-10-10 23:25:52,564 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-10 23:25:52,565 INFO L432 NwaCegarLoop]: 1147 mSDtfsCounter, 604 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:52,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1154 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:25:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79609 states. [2024-10-10 23:25:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79609 to 77356. [2024-10-10 23:25:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77356 states, 77355 states have (on average 1.0691487298817142) internal successors, (82704), 77355 states have internal predecessors, (82704), 0 states have call successors, (0), 0 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-10 23:25:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77356 states to 77356 states and 82704 transitions. [2024-10-10 23:25:53,669 INFO L78 Accepts]: Start accepts. Automaton has 77356 states and 82704 transitions. Word has length 481 [2024-10-10 23:25:53,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:53,670 INFO L471 AbstractCegarLoop]: Abstraction has 77356 states and 82704 transitions. [2024-10-10 23:25:53,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 77356 states and 82704 transitions. [2024-10-10 23:25:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-10-10 23:25:53,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:53,686 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:53,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:25:53,687 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:53,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:53,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1543731376, now seen corresponding path program 1 times [2024-10-10 23:25:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671468908] [2024-10-10 23:25:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-10 23:25:54,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:54,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671468908] [2024-10-10 23:25:54,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671468908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:54,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:54,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100977127] [2024-10-10 23:25:54,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:54,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:54,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:54,079 INFO L87 Difference]: Start difference. First operand 77356 states and 82704 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:56,689 INFO L93 Difference]: Finished difference Result 156213 states and 167059 transitions. [2024-10-10 23:25:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:56,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 572 [2024-10-10 23:25:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:56,776 INFO L225 Difference]: With dead ends: 156213 [2024-10-10 23:25:56,777 INFO L226 Difference]: Without dead ends: 78858 [2024-10-10 23:25:56,803 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-10 23:25:56,803 INFO L432 NwaCegarLoop]: 1026 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:56,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1033 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:25:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78858 states. [2024-10-10 23:25:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78858 to 78858. [2024-10-10 23:25:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78858 states, 78857 states have (on average 1.0610852555892312) internal successors, (83674), 78857 states have internal predecessors, (83674), 0 states have call successors, (0), 0 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-10 23:25:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78858 states to 78858 states and 83674 transitions. [2024-10-10 23:25:57,891 INFO L78 Accepts]: Start accepts. Automaton has 78858 states and 83674 transitions. Word has length 572 [2024-10-10 23:25:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:57,895 INFO L471 AbstractCegarLoop]: Abstraction has 78858 states and 83674 transitions. [2024-10-10 23:25:57,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:25:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 78858 states and 83674 transitions. [2024-10-10 23:25:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2024-10-10 23:25:57,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:57,920 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-10 23:25:57,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:25:57,921 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash 979901525, now seen corresponding path program 1 times [2024-10-10 23:25:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274697446] [2024-10-10 23:25:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-10 23:25:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274697446] [2024-10-10 23:25:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274697446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801033682] [2024-10-10 23:25:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:59,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:59,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:59,109 INFO L87 Difference]: Start difference. First operand 78858 states and 83674 transitions. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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-10 23:26:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:01,669 INFO L93 Difference]: Finished difference Result 158466 states and 168119 transitions. [2024-10-10 23:26:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:01,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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 599 [2024-10-10 23:26:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:01,935 INFO L225 Difference]: With dead ends: 158466 [2024-10-10 23:26:01,935 INFO L226 Difference]: Without dead ends: 79609 [2024-10-10 23:26:01,961 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-10 23:26:01,962 INFO L432 NwaCegarLoop]: 1126 mSDtfsCounter, 591 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:01,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1133 Invalid, 2415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:26:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79609 states. [2024-10-10 23:26:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79609 to 79609. [2024-10-10 23:26:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79609 states, 79608 states have (on average 1.0535498944829664) internal successors, (83871), 79608 states have internal predecessors, (83871), 0 states have call successors, (0), 0 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-10 23:26:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79609 states to 79609 states and 83871 transitions. [2024-10-10 23:26:02,760 INFO L78 Accepts]: Start accepts. Automaton has 79609 states and 83871 transitions. Word has length 599 [2024-10-10 23:26:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:02,760 INFO L471 AbstractCegarLoop]: Abstraction has 79609 states and 83871 transitions. [2024-10-10 23:26:02,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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-10 23:26:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 79609 states and 83871 transitions. [2024-10-10 23:26:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2024-10-10 23:26:02,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:02,776 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:02,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:26:02,776 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:02,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash 763718834, now seen corresponding path program 1 times [2024-10-10 23:26:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154468223] [2024-10-10 23:26:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:02,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-10-10 23:26:03,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154468223] [2024-10-10 23:26:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154468223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:03,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:03,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:03,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242555520] [2024-10-10 23:26:03,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:03,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:03,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:03,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:03,404 INFO L87 Difference]: Start difference. First operand 79609 states and 83871 transitions. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 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-10 23:26:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:06,140 INFO L93 Difference]: Finished difference Result 172735 states and 182711 transitions. [2024-10-10 23:26:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:06,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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 621 [2024-10-10 23:26:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:06,260 INFO L225 Difference]: With dead ends: 172735 [2024-10-10 23:26:06,260 INFO L226 Difference]: Without dead ends: 93127 [2024-10-10 23:26:06,315 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-10 23:26:06,316 INFO L432 NwaCegarLoop]: 1163 mSDtfsCounter, 603 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:06,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1170 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:26:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93127 states. [2024-10-10 23:26:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93127 to 93127. [2024-10-10 23:26:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93127 states, 93126 states have (on average 1.0488048450486438) internal successors, (97671), 93126 states have internal predecessors, (97671), 0 states have call successors, (0), 0 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-10 23:26:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93127 states to 93127 states and 97671 transitions. [2024-10-10 23:26:07,461 INFO L78 Accepts]: Start accepts. Automaton has 93127 states and 97671 transitions. Word has length 621 [2024-10-10 23:26:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:07,462 INFO L471 AbstractCegarLoop]: Abstraction has 93127 states and 97671 transitions. [2024-10-10 23:26:07,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 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-10 23:26:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 93127 states and 97671 transitions. [2024-10-10 23:26:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2024-10-10 23:26:07,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:07,475 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-10 23:26:07,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:26:07,476 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:07,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1741388266, now seen corresponding path program 1 times [2024-10-10 23:26:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:07,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592866823] [2024-10-10 23:26:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-10 23:26:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592866823] [2024-10-10 23:26:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592866823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:08,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:08,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:08,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721077068] [2024-10-10 23:26:08,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:08,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:08,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:08,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:08,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:08,495 INFO L87 Difference]: Start difference. First operand 93127 states and 97671 transitions. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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-10 23:26:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:11,025 INFO L93 Difference]: Finished difference Result 188506 states and 197631 transitions. [2024-10-10 23:26:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:11,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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 636 [2024-10-10 23:26:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:11,129 INFO L225 Difference]: With dead ends: 188506 [2024-10-10 23:26:11,129 INFO L226 Difference]: Without dead ends: 95380 [2024-10-10 23:26:11,180 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-10 23:26:11,180 INFO L432 NwaCegarLoop]: 1205 mSDtfsCounter, 592 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:11,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1212 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:26:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95380 states. [2024-10-10 23:26:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95380 to 93127. [2024-10-10 23:26:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93127 states, 93126 states have (on average 1.0484182720185555) internal successors, (97635), 93126 states have internal predecessors, (97635), 0 states have call successors, (0), 0 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-10 23:26:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93127 states to 93127 states and 97635 transitions. [2024-10-10 23:26:12,915 INFO L78 Accepts]: Start accepts. Automaton has 93127 states and 97635 transitions. Word has length 636 [2024-10-10 23:26:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:12,915 INFO L471 AbstractCegarLoop]: Abstraction has 93127 states and 97635 transitions. [2024-10-10 23:26:12,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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-10 23:26:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 93127 states and 97635 transitions. [2024-10-10 23:26:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2024-10-10 23:26:12,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:12,954 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:12,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:26:12,954 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:12,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:12,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1277009722, now seen corresponding path program 1 times [2024-10-10 23:26:12,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:12,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430015269] [2024-10-10 23:26:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 953 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-10 23:26:13,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:13,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430015269] [2024-10-10 23:26:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430015269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:13,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:13,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:26:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656585035] [2024-10-10 23:26:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:26:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:13,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:26:13,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:26:13,509 INFO L87 Difference]: Start difference. First operand 93127 states and 97635 transitions. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 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-10 23:26:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:17,321 INFO L93 Difference]: Finished difference Result 195265 states and 204658 transitions. [2024-10-10 23:26:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:26:17,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 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 655 [2024-10-10 23:26:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:17,659 INFO L225 Difference]: With dead ends: 195265 [2024-10-10 23:26:17,660 INFO L226 Difference]: Without dead ends: 102139 [2024-10-10 23:26:17,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:26:17,690 INFO L432 NwaCegarLoop]: 1188 mSDtfsCounter, 1308 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4965 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 5152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 4965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:17,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1208 Invalid, 5152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 4965 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:26:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102139 states.