./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/Problem17_label31.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/Problem17_label31.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 af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:47:17,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:47:17,268 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:47:17,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:47:17,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:47:17,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:47:17,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:47:17,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:47:17,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:47:17,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:47:17,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:47:17,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:47:17,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:47:17,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:47:17,321 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:47:17,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:47:17,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:47:17,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:47:17,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:47:17,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:47:17,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:47:17,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:47:17,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:47:17,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:47:17,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:47:17,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:47:17,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:47:17,326 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:47:17,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:47:17,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:47:17,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:47:17,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:47:17,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:47:17,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:47:17,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:47:17,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:47:17,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:47:17,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:47:17,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:47:17,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:47:17,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:47:17,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:47:17,328 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 -> af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 [2024-10-10 23:47:17,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:47:17,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:47:17,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:47:17,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:47:17,535 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:47:17,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2024-10-10 23:47:18,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:47:19,028 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:47:19,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2024-10-10 23:47:19,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0945467fd/cf0973f359244ea7b1a412be97c57a3d/FLAGe55cc3472 [2024-10-10 23:47:19,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0945467fd/cf0973f359244ea7b1a412be97c57a3d [2024-10-10 23:47:19,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:47:19,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:47:19,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:47:19,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:47:19,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:47:19,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:47:19" (1/1) ... [2024-10-10 23:47:19,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd42324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:19, skipping insertion in model container [2024-10-10 23:47:19,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:47:19" (1/1) ... [2024-10-10 23:47:19,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:47:19,316 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/Problem17_label31.c[1403,1416] [2024-10-10 23:47:19,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:47:19,727 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:47:19,739 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/Problem17_label31.c[1403,1416] [2024-10-10 23:47:19,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:47:20,006 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:47:20,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20 WrapperNode [2024-10-10 23:47:20,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:47:20,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:47:20,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:47:20,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:47:20,013 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:47:20" (1/1) ... [2024-10-10 23:47:20,048 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:47:20" (1/1) ... [2024-10-10 23:47:20,276 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:47:20,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:47:20,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:47:20,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:47:20,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:47:20,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,380 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,481 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:47:20,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:47:20,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:47:20,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:47:20,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:47:20,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (1/1) ... [2024-10-10 23:47:20,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:47:20,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:47:20,694 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:47:20,696 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:47:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:47:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:47:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:47:20,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:47:20,796 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:47:20,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:47:23,199 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:47:23,199 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:47:23,237 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:47:23,237 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:47:23,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:47:23 BoogieIcfgContainer [2024-10-10 23:47:23,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:47:23,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:47:23,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:47:23,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:47:23,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:47:19" (1/3) ... [2024-10-10 23:47:23,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6958e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:47:23, skipping insertion in model container [2024-10-10 23:47:23,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:20" (2/3) ... [2024-10-10 23:47:23,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6958e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:47:23, skipping insertion in model container [2024-10-10 23:47:23,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:47:23" (3/3) ... [2024-10-10 23:47:23,245 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label31.c [2024-10-10 23:47:23,257 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:47:23,257 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:47:23,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:47:23,354 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;@2194f047, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:47:23,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:47:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:47:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-10 23:47:23,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:23,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:23,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:23,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash -886352552, now seen corresponding path program 1 times [2024-10-10 23:47:23,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:23,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901910555] [2024-10-10 23:47:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:23,515 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:47:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:23,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901910555] [2024-10-10 23:47:23,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901910555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:23,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:23,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992674567] [2024-10-10 23:47:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:23,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:47:23,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:23,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:47:23,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:47:23,545 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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:47:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:23,604 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:47:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:47:23,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-10-10 23:47:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:23,623 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:47:23,624 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:47:23,629 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:47:23,633 INFO L432 NwaCegarLoop]: 935 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, 935 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:47:23,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:47:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:47:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:47:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 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:47:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:47:23,685 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 7 [2024-10-10 23:47:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:23,685 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:47:23,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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:47:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:47:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-10 23:47:23,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:23,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:23,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:47:23,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:23,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -888903046, now seen corresponding path program 1 times [2024-10-10 23:47:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718207230] [2024-10-10 23:47:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:23,760 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:47:23,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:23,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718207230] [2024-10-10 23:47:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718207230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:23,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540434930] [2024-10-10 23:47:23,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:23,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:23,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:23,766 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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:47:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:25,686 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-10 23:47:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:25,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-10-10 23:47:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:25,693 INFO L225 Difference]: With dead ends: 1501 [2024-10-10 23:47:25,694 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:47:25,694 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:47:25,695 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 464 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:25,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:47:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:47:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-10 23:47:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 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:47:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-10 23:47:25,721 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 7 [2024-10-10 23:47:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:25,722 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-10 23:47:25,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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:47:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-10 23:47:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-10 23:47:25,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:25,724 INFO L215 NwaCegarLoop]: trace histogram [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:47:25,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:47:25,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:25,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash 687201154, now seen corresponding path program 1 times [2024-10-10 23:47:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:25,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830588091] [2024-10-10 23:47:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:47:25,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:25,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830588091] [2024-10-10 23:47:25,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830588091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:25,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:25,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:25,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481638255] [2024-10-10 23:47:25,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:25,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:25,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:25,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:25,955 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:27,611 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2024-10-10 23:47:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:27,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-10 23:47:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:27,617 INFO L225 Difference]: With dead ends: 2812 [2024-10-10 23:47:27,617 INFO L226 Difference]: Without dead ends: 1843 [2024-10-10 23:47:27,618 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:47:27,619 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:27,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 577 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:47:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-10 23:47:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2024-10-10 23:47:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 0 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:47:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2024-10-10 23:47:27,645 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 74 [2024-10-10 23:47:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:27,645 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2024-10-10 23:47:27,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2024-10-10 23:47:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-10 23:47:27,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:27,651 INFO L215 NwaCegarLoop]: trace histogram [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:47:27,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:47:27,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:27,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1812824410, now seen corresponding path program 1 times [2024-10-10 23:47:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:27,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763578909] [2024-10-10 23:47:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:27,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:47:27,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763578909] [2024-10-10 23:47:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763578909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170190441] [2024-10-10 23:47:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:27,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:47:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:27,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:47:27,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:47:27,845 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:30,819 INFO L93 Difference]: Finished difference Result 5862 states and 8155 transitions. [2024-10-10 23:47:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:47:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-10 23:47:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:30,830 INFO L225 Difference]: With dead ends: 5862 [2024-10-10 23:47:30,831 INFO L226 Difference]: Without dead ends: 4023 [2024-10-10 23:47:30,835 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:47:30,837 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 972 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 3604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:30,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 434 Invalid, 3604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:47:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4023 states. [2024-10-10 23:47:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4023 to 4019. [2024-10-10 23:47:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 4018 states have (on average 1.326281732205077) internal successors, (5329), 4018 states have internal predecessors, (5329), 0 states have call successors, (0), 0 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:47:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5329 transitions. [2024-10-10 23:47:30,888 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5329 transitions. Word has length 77 [2024-10-10 23:47:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:30,889 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5329 transitions. [2024-10-10 23:47:30,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5329 transitions. [2024-10-10 23:47:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-10 23:47:30,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:30,892 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:30,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:47:30,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:30,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:30,894 INFO L85 PathProgramCache]: Analyzing trace with hash -465182885, now seen corresponding path program 1 times [2024-10-10 23:47:30,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:30,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570009564] [2024-10-10 23:47:30,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:30,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-10 23:47:31,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570009564] [2024-10-10 23:47:31,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570009564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:31,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:31,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:31,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791175061] [2024-10-10 23:47:31,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:31,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:31,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:31,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:31,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:31,090 INFO L87 Difference]: Start difference. First operand 4019 states and 5329 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:47:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:32,452 INFO L93 Difference]: Finished difference Result 10601 states and 14363 transitions. [2024-10-10 23:47:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 142 [2024-10-10 23:47:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:32,468 INFO L225 Difference]: With dead ends: 10601 [2024-10-10 23:47:32,468 INFO L226 Difference]: Without dead ends: 6579 [2024-10-10 23:47:32,474 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:47:32,477 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:32,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:32,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2024-10-10 23:47:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 5304. [2024-10-10 23:47:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5304 states, 5303 states have (on average 1.2268527248727135) internal successors, (6506), 5303 states have internal predecessors, (6506), 0 states have call successors, (0), 0 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:47:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 6506 transitions. [2024-10-10 23:47:32,545 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 6506 transitions. Word has length 142 [2024-10-10 23:47:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:32,546 INFO L471 AbstractCegarLoop]: Abstraction has 5304 states and 6506 transitions. [2024-10-10 23:47:32,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:47:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 6506 transitions. [2024-10-10 23:47:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-10 23:47:32,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:32,553 INFO L215 NwaCegarLoop]: trace histogram [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, 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:47:32,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:47:32,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:32,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash 541323431, now seen corresponding path program 1 times [2024-10-10 23:47:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:32,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659826284] [2024-10-10 23:47:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:32,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:47:32,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:32,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659826284] [2024-10-10 23:47:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659826284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:32,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743341048] [2024-10-10 23:47:32,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:32,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:32,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:32,705 INFO L87 Difference]: Start difference. First operand 5304 states and 6506 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:47:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:34,121 INFO L93 Difference]: Finished difference Result 13164 states and 16535 transitions. [2024-10-10 23:47:34,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:34,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-10 23:47:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:34,138 INFO L225 Difference]: With dead ends: 13164 [2024-10-10 23:47:34,138 INFO L226 Difference]: Without dead ends: 7861 [2024-10-10 23:47:34,143 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:47:34,144 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 500 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:34,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 805 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7861 states. [2024-10-10 23:47:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7861 to 7861. [2024-10-10 23:47:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7861 states, 7860 states have (on average 1.210178117048346) internal successors, (9512), 7860 states have internal predecessors, (9512), 0 states have call successors, (0), 0 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:47:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 9512 transitions. [2024-10-10 23:47:34,233 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 9512 transitions. Word has length 155 [2024-10-10 23:47:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:34,233 INFO L471 AbstractCegarLoop]: Abstraction has 7861 states and 9512 transitions. [2024-10-10 23:47:34,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:47:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 9512 transitions. [2024-10-10 23:47:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-10 23:47:34,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:34,238 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 23:47:34,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:47:34,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:34,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1196853403, now seen corresponding path program 1 times [2024-10-10 23:47:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:34,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033027613] [2024-10-10 23:47:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-10-10 23:47:34,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:34,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033027613] [2024-10-10 23:47:34,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033027613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:34,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:34,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:34,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010079060] [2024-10-10 23:47:34,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:34,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:34,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:34,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:34,419 INFO L87 Difference]: Start difference. First operand 7861 states and 9512 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:35,809 INFO L93 Difference]: Finished difference Result 19109 states and 23098 transitions. [2024-10-10 23:47:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:35,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2024-10-10 23:47:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:35,830 INFO L225 Difference]: With dead ends: 19109 [2024-10-10 23:47:35,831 INFO L226 Difference]: Without dead ends: 10399 [2024-10-10 23:47:35,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:35,839 INFO L432 NwaCegarLoop]: 879 mSDtfsCounter, 436 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:35,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 949 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10399 states. [2024-10-10 23:47:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10399 to 7414. [2024-10-10 23:47:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7414 states, 7413 states have (on average 1.165789828679347) internal successors, (8642), 7413 states have internal predecessors, (8642), 0 states have call successors, (0), 0 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:47:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7414 states to 7414 states and 8642 transitions. [2024-10-10 23:47:35,946 INFO L78 Accepts]: Start accepts. Automaton has 7414 states and 8642 transitions. Word has length 260 [2024-10-10 23:47:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:35,947 INFO L471 AbstractCegarLoop]: Abstraction has 7414 states and 8642 transitions. [2024-10-10 23:47:35,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7414 states and 8642 transitions. [2024-10-10 23:47:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-10 23:47:35,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:35,950 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 23:47:35,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:47:35,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:35,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1766775569, now seen corresponding path program 1 times [2024-10-10 23:47:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:35,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393304867] [2024-10-10 23:47:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-10-10 23:47:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393304867] [2024-10-10 23:47:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393304867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:36,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:36,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:36,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117479774] [2024-10-10 23:47:36,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:36,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:36,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:36,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:36,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:36,095 INFO L87 Difference]: Start difference. First operand 7414 states and 8642 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:37,448 INFO L93 Difference]: Finished difference Result 18650 states and 21995 transitions. [2024-10-10 23:47:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:37,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2024-10-10 23:47:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:37,504 INFO L225 Difference]: With dead ends: 18650 [2024-10-10 23:47:37,504 INFO L226 Difference]: Without dead ends: 11236 [2024-10-10 23:47:37,508 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:47:37,509 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 451 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:37,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 423 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11236 states. [2024-10-10 23:47:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11236 to 8666. [2024-10-10 23:47:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8666 states, 8665 states have (on average 1.1521061742642815) internal successors, (9983), 8665 states have internal predecessors, (9983), 0 states have call successors, (0), 0 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:47:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8666 states to 8666 states and 9983 transitions. [2024-10-10 23:47:37,579 INFO L78 Accepts]: Start accepts. Automaton has 8666 states and 9983 transitions. Word has length 264 [2024-10-10 23:47:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:37,579 INFO L471 AbstractCegarLoop]: Abstraction has 8666 states and 9983 transitions. [2024-10-10 23:47:37,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 8666 states and 9983 transitions. [2024-10-10 23:47:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-10 23:47:37,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:37,582 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 23:47:37,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:47:37,583 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:37,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1943894659, now seen corresponding path program 1 times [2024-10-10 23:47:37,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:37,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767454102] [2024-10-10 23:47:37,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-10 23:47:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767454102] [2024-10-10 23:47:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767454102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:37,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:37,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964496212] [2024-10-10 23:47:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:37,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:37,751 INFO L87 Difference]: Start difference. First operand 8666 states and 9983 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:39,146 INFO L93 Difference]: Finished difference Result 22010 states and 25364 transitions. [2024-10-10 23:47:39,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:39,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2024-10-10 23:47:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:39,162 INFO L225 Difference]: With dead ends: 22010 [2024-10-10 23:47:39,162 INFO L226 Difference]: Without dead ends: 13345 [2024-10-10 23:47:39,170 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:47:39,171 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 483 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:39,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 394 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13345 states. [2024-10-10 23:47:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13345 to 11641. [2024-10-10 23:47:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11641 states, 11640 states have (on average 1.1441580756013745) internal successors, (13318), 11640 states have internal predecessors, (13318), 0 states have call successors, (0), 0 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:47:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11641 states to 11641 states and 13318 transitions. [2024-10-10 23:47:39,319 INFO L78 Accepts]: Start accepts. Automaton has 11641 states and 13318 transitions. Word has length 277 [2024-10-10 23:47:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:39,320 INFO L471 AbstractCegarLoop]: Abstraction has 11641 states and 13318 transitions. [2024-10-10 23:47:39,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 11641 states and 13318 transitions. [2024-10-10 23:47:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-10-10 23:47:39,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:39,324 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 23:47:39,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:47:39,324 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:39,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2131638992, now seen corresponding path program 1 times [2024-10-10 23:47:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962162126] [2024-10-10 23:47:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 23:47:39,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962162126] [2024-10-10 23:47:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962162126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:39,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484939390] [2024-10-10 23:47:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:39,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:39,567 INFO L87 Difference]: Start difference. First operand 11641 states and 13318 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:47:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:40,961 INFO L93 Difference]: Finished difference Result 28846 states and 33335 transitions. [2024-10-10 23:47:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:40,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 321 [2024-10-10 23:47:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:40,981 INFO L225 Difference]: With dead ends: 28846 [2024-10-10 23:47:40,981 INFO L226 Difference]: Without dead ends: 16781 [2024-10-10 23:47:40,993 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:47:40,994 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 382 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:40,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 912 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16781 states. [2024-10-10 23:47:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16781 to 16348. [2024-10-10 23:47:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16348 states, 16347 states have (on average 1.1292591912889216) internal successors, (18460), 16347 states have internal predecessors, (18460), 0 states have call successors, (0), 0 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:47:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16348 states to 16348 states and 18460 transitions. [2024-10-10 23:47:41,248 INFO L78 Accepts]: Start accepts. Automaton has 16348 states and 18460 transitions. Word has length 321 [2024-10-10 23:47:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:41,248 INFO L471 AbstractCegarLoop]: Abstraction has 16348 states and 18460 transitions. [2024-10-10 23:47:41,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:47:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 16348 states and 18460 transitions. [2024-10-10 23:47:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-10 23:47:41,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:41,253 INFO L215 NwaCegarLoop]: trace histogram [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, 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:47:41,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:47:41,253 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:41,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1912068378, now seen corresponding path program 1 times [2024-10-10 23:47:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:41,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709160685] [2024-10-10 23:47:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:47:41,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:41,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709160685] [2024-10-10 23:47:41,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709160685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:41,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:41,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:41,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326019872] [2024-10-10 23:47:41,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:41,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:41,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:41,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:41,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:41,501 INFO L87 Difference]: Start difference. First operand 16348 states and 18460 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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:47:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:42,831 INFO L93 Difference]: Finished difference Result 39112 states and 44252 transitions. [2024-10-10 23:47:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:42,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 328 [2024-10-10 23:47:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:42,855 INFO L225 Difference]: With dead ends: 39112 [2024-10-10 23:47:42,855 INFO L226 Difference]: Without dead ends: 22332 [2024-10-10 23:47:42,870 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:47:42,871 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 393 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:42,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 768 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:47:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22332 states. [2024-10-10 23:47:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22332 to 19345. [2024-10-10 23:47:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19345 states, 19344 states have (on average 1.1328060380479736) internal successors, (21913), 19344 states have internal predecessors, (21913), 0 states have call successors, (0), 0 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:47:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19345 states to 19345 states and 21913 transitions. [2024-10-10 23:47:43,117 INFO L78 Accepts]: Start accepts. Automaton has 19345 states and 21913 transitions. Word has length 328 [2024-10-10 23:47:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:43,118 INFO L471 AbstractCegarLoop]: Abstraction has 19345 states and 21913 transitions. [2024-10-10 23:47:43,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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:47:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 19345 states and 21913 transitions. [2024-10-10 23:47:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-10-10 23:47:43,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:43,124 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1] [2024-10-10 23:47:43,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:47:43,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:43,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash -79761084, now seen corresponding path program 1 times [2024-10-10 23:47:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257627004] [2024-10-10 23:47:43,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:47:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:43,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257627004] [2024-10-10 23:47:43,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257627004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:43,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:43,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:43,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17721435] [2024-10-10 23:47:43,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:43,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:43,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:43,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:43,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:43,318 INFO L87 Difference]: Start difference. First operand 19345 states and 21913 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:47:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:44,531 INFO L93 Difference]: Finished difference Result 45074 states and 51540 transitions. [2024-10-10 23:47:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:44,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 402 [2024-10-10 23:47:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:44,555 INFO L225 Difference]: With dead ends: 45074 [2024-10-10 23:47:44,555 INFO L226 Difference]: Without dead ends: 25305 [2024-10-10 23:47:44,645 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:47:44,646 INFO L432 NwaCegarLoop]: 730 mSDtfsCounter, 341 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:44,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 788 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:47:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25305 states. [2024-10-10 23:47:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25305 to 19319. [2024-10-10 23:47:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19319 states, 19318 states have (on average 1.1325188942954758) internal successors, (21878), 19318 states have internal predecessors, (21878), 0 states have call successors, (0), 0 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:47:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19319 states to 19319 states and 21878 transitions. [2024-10-10 23:47:44,792 INFO L78 Accepts]: Start accepts. Automaton has 19319 states and 21878 transitions. Word has length 402 [2024-10-10 23:47:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:44,793 INFO L471 AbstractCegarLoop]: Abstraction has 19319 states and 21878 transitions. [2024-10-10 23:47:44,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:47:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 19319 states and 21878 transitions. [2024-10-10 23:47:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-10-10 23:47:44,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:44,800 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 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] [2024-10-10 23:47:44,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:47:44,801 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1372487369, now seen corresponding path program 1 times [2024-10-10 23:47:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:44,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054885553] [2024-10-10 23:47:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-10 23:47:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:45,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054885553] [2024-10-10 23:47:45,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054885553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:45,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:45,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:45,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346129176] [2024-10-10 23:47:45,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:45,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:45,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:45,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:45,033 INFO L87 Difference]: Start difference. First operand 19319 states and 21878 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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:47:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:46,481 INFO L93 Difference]: Finished difference Result 47155 states and 53417 transitions. [2024-10-10 23:47:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:46,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 403 [2024-10-10 23:47:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:46,507 INFO L225 Difference]: With dead ends: 47155 [2024-10-10 23:47:46,508 INFO L226 Difference]: Without dead ends: 26976 [2024-10-10 23:47:46,520 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:47:46,521 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 446 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:46,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 660 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26976 states. [2024-10-10 23:47:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26976 to 24413. [2024-10-10 23:47:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24413 states, 24412 states have (on average 1.12350483368835) internal successors, (27427), 24412 states have internal predecessors, (27427), 0 states have call successors, (0), 0 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:47:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24413 states to 24413 states and 27427 transitions. [2024-10-10 23:47:46,708 INFO L78 Accepts]: Start accepts. Automaton has 24413 states and 27427 transitions. Word has length 403 [2024-10-10 23:47:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:46,708 INFO L471 AbstractCegarLoop]: Abstraction has 24413 states and 27427 transitions. [2024-10-10 23:47:46,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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:47:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 24413 states and 27427 transitions. [2024-10-10 23:47:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-10-10 23:47:46,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:46,715 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1] [2024-10-10 23:47:46,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:47:46,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:46,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:46,715 INFO L85 PathProgramCache]: Analyzing trace with hash 581900032, now seen corresponding path program 1 times [2024-10-10 23:47:46,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:46,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004672906] [2024-10-10 23:47:46,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:46,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 23:47:47,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:47,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004672906] [2024-10-10 23:47:47,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004672906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:47,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:47,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:47:47,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503252] [2024-10-10 23:47:47,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:47,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:47:47,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:47,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:47:47,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:47:47,145 INFO L87 Difference]: Start difference. First operand 24413 states and 27427 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 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:47:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:49,273 INFO L93 Difference]: Finished difference Result 62486 states and 70115 transitions. [2024-10-10 23:47:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:47:49,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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 407 [2024-10-10 23:47:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:49,312 INFO L225 Difference]: With dead ends: 62486 [2024-10-10 23:47:49,312 INFO L226 Difference]: Without dead ends: 38074 [2024-10-10 23:47:49,333 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:47:49,334 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 825 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:49,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 208 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:47:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38074 states. [2024-10-10 23:47:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38074 to 34225. [2024-10-10 23:47:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34225 states, 34224 states have (on average 1.1238896680691912) internal successors, (38464), 34224 states have internal predecessors, (38464), 0 states have call successors, (0), 0 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:47:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34225 states to 34225 states and 38464 transitions. [2024-10-10 23:47:49,627 INFO L78 Accepts]: Start accepts. Automaton has 34225 states and 38464 transitions. Word has length 407 [2024-10-10 23:47:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:49,627 INFO L471 AbstractCegarLoop]: Abstraction has 34225 states and 38464 transitions. [2024-10-10 23:47:49,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 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:47:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 34225 states and 38464 transitions. [2024-10-10 23:47:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-10 23:47:49,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:49,633 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:49,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:47:49,633 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:49,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1336324562, now seen corresponding path program 1 times [2024-10-10 23:47:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:49,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402660742] [2024-10-10 23:47:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-10 23:47:49,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:49,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402660742] [2024-10-10 23:47:49,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402660742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:49,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:49,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:49,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624242838] [2024-10-10 23:47:49,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:49,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:49,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:49,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:49,920 INFO L87 Difference]: Start difference. First operand 34225 states and 38464 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:47:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:51,207 INFO L93 Difference]: Finished difference Result 77394 states and 87185 transitions. [2024-10-10 23:47:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:51,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 426 [2024-10-10 23:47:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:51,250 INFO L225 Difference]: With dead ends: 77394 [2024-10-10 23:47:51,250 INFO L226 Difference]: Without dead ends: 43170 [2024-10-10 23:47:51,273 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:47:51,274 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 392 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:51,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 332 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:47:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43170 states. [2024-10-10 23:47:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43170 to 42735. [2024-10-10 23:47:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42735 states, 42734 states have (on average 1.1186408948378341) internal successors, (47804), 42734 states have internal predecessors, (47804), 0 states have call successors, (0), 0 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:47:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42735 states to 42735 states and 47804 transitions. [2024-10-10 23:47:51,794 INFO L78 Accepts]: Start accepts. Automaton has 42735 states and 47804 transitions. Word has length 426 [2024-10-10 23:47:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:51,794 INFO L471 AbstractCegarLoop]: Abstraction has 42735 states and 47804 transitions. [2024-10-10 23:47:51,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:47:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 42735 states and 47804 transitions. [2024-10-10 23:47:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-10-10 23:47:51,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:51,799 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:51,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:47:51,799 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:51,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1120045746, now seen corresponding path program 1 times [2024-10-10 23:47:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851812882] [2024-10-10 23:47:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-10 23:47:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851812882] [2024-10-10 23:47:52,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851812882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:52,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:52,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:52,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158637276] [2024-10-10 23:47:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:52,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:52,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:52,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:52,260 INFO L87 Difference]: Start difference. First operand 42735 states and 47804 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:47:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:53,638 INFO L93 Difference]: Finished difference Result 98671 states and 109853 transitions. [2024-10-10 23:47:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:53,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 427 [2024-10-10 23:47:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:53,695 INFO L225 Difference]: With dead ends: 98671 [2024-10-10 23:47:53,695 INFO L226 Difference]: Without dead ends: 55085 [2024-10-10 23:47:53,725 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:47:53,726 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 373 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:53,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 822 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:47:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55085 states. [2024-10-10 23:47:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55085 to 52940. [2024-10-10 23:47:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52940 states, 52939 states have (on average 1.1039498290485275) internal successors, (58442), 52939 states have internal predecessors, (58442), 0 states have call successors, (0), 0 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:47:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52940 states to 52940 states and 58442 transitions. [2024-10-10 23:47:54,594 INFO L78 Accepts]: Start accepts. Automaton has 52940 states and 58442 transitions. Word has length 427 [2024-10-10 23:47:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:54,595 INFO L471 AbstractCegarLoop]: Abstraction has 52940 states and 58442 transitions. [2024-10-10 23:47:54,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:47:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 52940 states and 58442 transitions. [2024-10-10 23:47:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-10-10 23:47:54,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:54,601 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:54,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:47:54,602 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:54,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash -546389228, now seen corresponding path program 1 times [2024-10-10 23:47:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:54,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289214089] [2024-10-10 23:47:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:54,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:47:54,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289214089] [2024-10-10 23:47:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289214089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:54,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215717803] [2024-10-10 23:47:54,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:54,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:54,978 INFO L87 Difference]: Start difference. First operand 52940 states and 58442 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:47:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:56,462 INFO L93 Difference]: Finished difference Result 122064 states and 134671 transitions. [2024-10-10 23:47:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 450 [2024-10-10 23:47:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:56,544 INFO L225 Difference]: With dead ends: 122064 [2024-10-10 23:47:56,544 INFO L226 Difference]: Without dead ends: 68697 [2024-10-10 23:47:56,688 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:47:56,689 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 295 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:56,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 825 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:47:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68697 states. [2024-10-10 23:47:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68697 to 67827. [2024-10-10 23:47:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67827 states, 67826 states have (on average 1.0920738359920974) internal successors, (74071), 67826 states have internal predecessors, (74071), 0 states have call successors, (0), 0 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:47:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67827 states to 67827 states and 74071 transitions. [2024-10-10 23:47:57,384 INFO L78 Accepts]: Start accepts. Automaton has 67827 states and 74071 transitions. Word has length 450 [2024-10-10 23:47:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:57,384 INFO L471 AbstractCegarLoop]: Abstraction has 67827 states and 74071 transitions. [2024-10-10 23:47:57,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:47:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 67827 states and 74071 transitions. [2024-10-10 23:47:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-10-10 23:47:57,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:57,392 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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:47:57,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:47:57,393 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:57,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash -854575498, now seen corresponding path program 1 times [2024-10-10 23:47:57,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:57,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001077592] [2024-10-10 23:47:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:57,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-10 23:47:57,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:57,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001077592] [2024-10-10 23:47:57,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001077592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:57,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131983899] [2024-10-10 23:47:57,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:57,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:57,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:57,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:57,863 INFO L87 Difference]: Start difference. First operand 67827 states and 74071 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:47:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:59,396 INFO L93 Difference]: Finished difference Result 143339 states and 156656 transitions. [2024-10-10 23:47:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:59,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 450 [2024-10-10 23:47:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:59,469 INFO L225 Difference]: With dead ends: 143339 [2024-10-10 23:47:59,469 INFO L226 Difference]: Without dead ends: 75084 [2024-10-10 23:47:59,487 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:47:59,488 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 434 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:59,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 247 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75084 states. [2024-10-10 23:48:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75084 to 72931. [2024-10-10 23:48:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72931 states, 72930 states have (on average 1.0914575620457974) internal successors, (79600), 72930 states have internal predecessors, (79600), 0 states have call successors, (0), 0 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:48:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72931 states to 72931 states and 79600 transitions. [2024-10-10 23:48:00,150 INFO L78 Accepts]: Start accepts. Automaton has 72931 states and 79600 transitions. Word has length 450 [2024-10-10 23:48:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:00,151 INFO L471 AbstractCegarLoop]: Abstraction has 72931 states and 79600 transitions. [2024-10-10 23:48:00,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:48:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 72931 states and 79600 transitions. [2024-10-10 23:48:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2024-10-10 23:48:00,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:00,156 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:48:00,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:48:00,157 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:00,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash -133256135, now seen corresponding path program 1 times [2024-10-10 23:48:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:00,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228799259] [2024-10-10 23:48:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:48:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228799259] [2024-10-10 23:48:00,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228799259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:00,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:00,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:00,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480412321] [2024-10-10 23:48:00,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:00,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:00,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:00,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:00,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:00,841 INFO L87 Difference]: Start difference. First operand 72931 states and 79600 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:48:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:02,242 INFO L93 Difference]: Finished difference Result 156510 states and 170701 transitions. [2024-10-10 23:48:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:02,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 453 [2024-10-10 23:48:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:02,334 INFO L225 Difference]: With dead ends: 156510 [2024-10-10 23:48:02,334 INFO L226 Difference]: Without dead ends: 83155 [2024-10-10 23:48:02,385 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:48:02,386 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 247 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:02,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 778 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:48:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83155 states. [2024-10-10 23:48:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83155 to 78467. [2024-10-10 23:48:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78467 states, 78466 states have (on average 1.0862794076415263) internal successors, (85236), 78466 states have internal predecessors, (85236), 0 states have call successors, (0), 0 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:48:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78467 states to 78467 states and 85236 transitions. [2024-10-10 23:48:03,289 INFO L78 Accepts]: Start accepts. Automaton has 78467 states and 85236 transitions. Word has length 453 [2024-10-10 23:48:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:03,290 INFO L471 AbstractCegarLoop]: Abstraction has 78467 states and 85236 transitions. [2024-10-10 23:48:03,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:48:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 78467 states and 85236 transitions. [2024-10-10 23:48:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-10-10 23:48:03,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:03,296 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:03,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:48:03,297 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:03,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1845463455, now seen corresponding path program 1 times [2024-10-10 23:48:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746300413] [2024-10-10 23:48:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:03,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:48:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746300413] [2024-10-10 23:48:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746300413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979571716] [2024-10-10 23:48:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:03,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:03,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:03,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:03,772 INFO L87 Difference]: Start difference. First operand 78467 states and 85236 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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:48:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:05,514 INFO L93 Difference]: Finished difference Result 180773 states and 196654 transitions. [2024-10-10 23:48:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:05,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 498 [2024-10-10 23:48:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:05,657 INFO L225 Difference]: With dead ends: 180773 [2024-10-10 23:48:05,657 INFO L226 Difference]: Without dead ends: 101869 [2024-10-10 23:48:05,701 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:48:05,701 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 484 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:05,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 701 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:48:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101869 states. [2024-10-10 23:48:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101869 to 96738. [2024-10-10 23:48:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96738 states, 96737 states have (on average 1.0824606923927762) internal successors, (104714), 96737 states have internal predecessors, (104714), 0 states have call successors, (0), 0 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:48:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96738 states to 96738 states and 104714 transitions. [2024-10-10 23:48:06,835 INFO L78 Accepts]: Start accepts. Automaton has 96738 states and 104714 transitions. Word has length 498 [2024-10-10 23:48:06,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:06,835 INFO L471 AbstractCegarLoop]: Abstraction has 96738 states and 104714 transitions. [2024-10-10 23:48:06,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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:48:06,835 INFO L276 IsEmpty]: Start isEmpty. Operand 96738 states and 104714 transitions. [2024-10-10 23:48:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2024-10-10 23:48:06,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:06,845 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:48:06,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:48:06,845 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:06,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1353035066, now seen corresponding path program 1 times [2024-10-10 23:48:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:06,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166755482] [2024-10-10 23:48:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-10 23:48:07,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:07,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166755482] [2024-10-10 23:48:07,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166755482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:07,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:07,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701334744] [2024-10-10 23:48:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:07,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:07,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:07,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:07,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:07,355 INFO L87 Difference]: Start difference. First operand 96738 states and 104714 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:48:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:09,135 INFO L93 Difference]: Finished difference Result 209257 states and 226539 transitions. [2024-10-10 23:48:09,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:09,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 542 [2024-10-10 23:48:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:09,255 INFO L225 Difference]: With dead ends: 209257 [2024-10-10 23:48:09,256 INFO L226 Difference]: Without dead ends: 112520 [2024-10-10 23:48:09,284 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:48:09,285 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 307 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:09,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 292 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:48:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112520 states. [2024-10-10 23:48:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112520 to 109520. [2024-10-10 23:48:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109520 states, 109519 states have (on average 1.081300961477004) internal successors, (118423), 109519 states have internal predecessors, (118423), 0 states have call successors, (0), 0 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:48:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109520 states to 109520 states and 118423 transitions. [2024-10-10 23:48:10,657 INFO L78 Accepts]: Start accepts. Automaton has 109520 states and 118423 transitions. Word has length 542 [2024-10-10 23:48:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:10,659 INFO L471 AbstractCegarLoop]: Abstraction has 109520 states and 118423 transitions. [2024-10-10 23:48:10,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:48:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 109520 states and 118423 transitions. [2024-10-10 23:48:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2024-10-10 23:48:10,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:10,669 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:10,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:48:10,669 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:10,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1979193839, now seen corresponding path program 1 times [2024-10-10 23:48:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:10,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554874015] [2024-10-10 23:48:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-10 23:48:10,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:10,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554874015] [2024-10-10 23:48:10,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554874015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:10,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 23:48:10,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205235839] [2024-10-10 23:48:10,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:10,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:48:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:10,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:48:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:48:10,953 INFO L87 Difference]: Start difference. First operand 109520 states and 118423 transitions. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:48:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:14,249 INFO L93 Difference]: Finished difference Result 257792 states and 278712 transitions. [2024-10-10 23:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:48:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 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 562 [2024-10-10 23:48:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:14,415 INFO L225 Difference]: With dead ends: 257792 [2024-10-10 23:48:14,415 INFO L226 Difference]: Without dead ends: 147845 [2024-10-10 23:48:14,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:48:14,438 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1214 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 3337 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 3337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:14,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 249 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 3337 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:48:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147845 states. [2024-10-10 23:48:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147845 to 128677. [2024-10-10 23:48:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128677 states, 128676 states have (on average 1.0749479312381485) internal successors, (138320), 128676 states have internal predecessors, (138320), 0 states have call successors, (0), 0 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:48:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128677 states to 128677 states and 138320 transitions. [2024-10-10 23:48:16,123 INFO L78 Accepts]: Start accepts. Automaton has 128677 states and 138320 transitions. Word has length 562 [2024-10-10 23:48:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 128677 states and 138320 transitions. [2024-10-10 23:48:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:48:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 128677 states and 138320 transitions. [2024-10-10 23:48:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2024-10-10 23:48:16,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:16,134 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:16,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 23:48:16,134 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:16,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1505958189, now seen corresponding path program 1 times [2024-10-10 23:48:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206888721] [2024-10-10 23:48:16,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:16,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-10 23:48:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206888721] [2024-10-10 23:48:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206888721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 23:48:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159690197] [2024-10-10 23:48:16,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:16,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:48:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:48:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:48:16,423 INFO L87 Difference]: Start difference. First operand 128677 states and 138320 transitions. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:48:19,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:19,564 INFO L93 Difference]: Finished difference Result 293132 states and 315247 transitions. [2024-10-10 23:48:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:48:19,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 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 562 [2024-10-10 23:48:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:19,763 INFO L225 Difference]: With dead ends: 293132 [2024-10-10 23:48:19,763 INFO L226 Difference]: Without dead ends: 163606 [2024-10-10 23:48:20,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:48:20,070 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1654 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:20,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 179 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:48:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163606 states. [2024-10-10 23:48:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163606 to 135490. [2024-10-10 23:48:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135490 states, 135489 states have (on average 1.072721770771059) internal successors, (145342), 135489 states have internal predecessors, (145342), 0 states have call successors, (0), 0 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:48:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135490 states to 135490 states and 145342 transitions. [2024-10-10 23:48:21,601 INFO L78 Accepts]: Start accepts. Automaton has 135490 states and 145342 transitions. Word has length 562 [2024-10-10 23:48:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:21,602 INFO L471 AbstractCegarLoop]: Abstraction has 135490 states and 145342 transitions. [2024-10-10 23:48:21,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:48:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 135490 states and 145342 transitions. [2024-10-10 23:48:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2024-10-10 23:48:21,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:21,610 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:21,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 23:48:21,610 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:21,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1467730124, now seen corresponding path program 1 times [2024-10-10 23:48:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:21,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001612449] [2024-10-10 23:48:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-10-10 23:48:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:22,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001612449] [2024-10-10 23:48:22,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001612449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:22,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:48:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756223166] [2024-10-10 23:48:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:22,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:22,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:22,468 INFO L87 Difference]: Start difference. First operand 135490 states and 145342 transitions. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:48:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:25,187 INFO L93 Difference]: Finished difference Result 282047 states and 302192 transitions. [2024-10-10 23:48:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 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 567 [2024-10-10 23:48:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:25,374 INFO L225 Difference]: With dead ends: 282047 [2024-10-10 23:48:25,374 INFO L226 Difference]: Without dead ends: 146983 [2024-10-10 23:48:25,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:25,473 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 727 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:25,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 341 Invalid, 3105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 2799 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:48:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146983 states. [2024-10-10 23:48:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146983 to 143573. [2024-10-10 23:48:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143573 states, 143572 states have (on average 1.065465411082941) internal successors, (152971), 143572 states have internal predecessors, (152971), 0 states have call successors, (0), 0 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:48:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143573 states to 143573 states and 152971 transitions. [2024-10-10 23:48:27,313 INFO L78 Accepts]: Start accepts. Automaton has 143573 states and 152971 transitions. Word has length 567 [2024-10-10 23:48:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:27,314 INFO L471 AbstractCegarLoop]: Abstraction has 143573 states and 152971 transitions. [2024-10-10 23:48:27,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:48:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 143573 states and 152971 transitions. [2024-10-10 23:48:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-10-10 23:48:27,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:27,323 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 23:48:27,323 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:27,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2098099621, now seen corresponding path program 1 times [2024-10-10 23:48:27,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:27,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86609564] [2024-10-10 23:48:27,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:27,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-10-10 23:48:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86609564] [2024-10-10 23:48:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86609564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:27,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:27,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511703985] [2024-10-10 23:48:27,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:27,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:27,488 INFO L87 Difference]: Start difference. First operand 143573 states and 152971 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:48:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:29,309 INFO L93 Difference]: Finished difference Result 284591 states and 303115 transitions. [2024-10-10 23:48:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 593 [2024-10-10 23:48:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:29,453 INFO L225 Difference]: With dead ends: 284591 [2024-10-10 23:48:29,453 INFO L226 Difference]: Without dead ends: 141444 [2024-10-10 23:48:29,533 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:48:29,533 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 497 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:29,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 611 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:48:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141444 states. [2024-10-10 23:48:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141444 to 141011. [2024-10-10 23:48:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141011 states, 141010 states have (on average 1.0575703850790723) internal successors, (149128), 141010 states have internal predecessors, (149128), 0 states have call successors, (0), 0 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:48:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141011 states to 141011 states and 149128 transitions. [2024-10-10 23:48:31,711 INFO L78 Accepts]: Start accepts. Automaton has 141011 states and 149128 transitions. Word has length 593 [2024-10-10 23:48:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:31,711 INFO L471 AbstractCegarLoop]: Abstraction has 141011 states and 149128 transitions. [2024-10-10 23:48:31,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:48:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 141011 states and 149128 transitions. [2024-10-10 23:48:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-10-10 23:48:31,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:31,722 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:31,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 23:48:31,722 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:31,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1052533519, now seen corresponding path program 1 times [2024-10-10 23:48:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385258269] [2024-10-10 23:48:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:31,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-10 23:48:32,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:32,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385258269] [2024-10-10 23:48:32,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385258269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:32,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:32,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:48:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128124203] [2024-10-10 23:48:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:32,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:32,323 INFO L87 Difference]: Start difference. First operand 141011 states and 149128 transitions. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 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:48:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:34,790 INFO L93 Difference]: Finished difference Result 292266 states and 309000 transitions. [2024-10-10 23:48:34,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:34,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 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 596 [2024-10-10 23:48:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:34,965 INFO L225 Difference]: With dead ends: 292266 [2024-10-10 23:48:34,966 INFO L226 Difference]: Without dead ends: 151681 [2024-10-10 23:48:35,024 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:48:35,024 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 717 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:35,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 260 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:48:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151681 states.