./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_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 451c7dc1e9ccbf0e1b2bfff20c93c74c6a2c224dafb02ba3904b999265578105 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:58:34,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:58:34,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:58:34,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:58:34,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:58:34,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:58:34,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:58:34,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:58:34,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:58:34,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:58:34,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:58:34,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:58:34,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:58:34,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:58:34,938 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:58:34,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:58:34,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:58:34,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:58:34,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:58:34,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:58:34,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:58:34,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:58:34,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:58:34,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:58:34,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:58:34,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:58:34,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:58:34,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:58:34,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:58:34,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:58:34,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:58:34,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:58:34,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:58:34,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:58:34,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:58:34,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:58:34,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:58:34,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:58:34,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:58:34,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:58:34,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:58:34,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:58:34,950 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 451c7dc1e9ccbf0e1b2bfff20c93c74c6a2c224dafb02ba3904b999265578105 [2024-10-13 23:58:35,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:58:35,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:58:35,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:58:35,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:58:35,195 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:58:35,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label50.c [2024-10-13 23:58:36,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:58:37,046 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:58:37,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label50.c [2024-10-13 23:58:37,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b224ac83b/febe76b1fd5447368578be3c06f6b965/FLAG5914da2f4 [2024-10-13 23:58:37,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b224ac83b/febe76b1fd5447368578be3c06f6b965 [2024-10-13 23:58:37,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:58:37,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:58:37,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:58:37,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:58:37,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:58:37,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:58:37" (1/1) ... [2024-10-13 23:58:37,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb73808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:37, skipping insertion in model container [2024-10-13 23:58:37,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:58:37" (1/1) ... [2024-10-13 23:58:37,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:58:37,387 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_label50.c[1517,1530] [2024-10-13 23:58:37,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:58:37,981 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:58:37,994 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_label50.c[1517,1530] [2024-10-13 23:58:38,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:58:38,290 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:58:38,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38 WrapperNode [2024-10-13 23:58:38,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:58:38,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:58:38,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:58:38,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:58:38,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:38,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:38,666 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-13 23:58:38,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:58:38,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:58:38,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:58:38,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:58:38,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:38,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:38,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:38,881 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-13 23:58:38,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:38,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:38,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:39,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:39,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:39,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:39,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:58:39,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:58:39,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:58:39,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:58:39,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (1/1) ... [2024-10-13 23:58:39,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:58:39,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:58:39,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:58:39,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:58:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:58:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:58:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:58:39,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:58:39,232 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:58:39,234 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:58:42,465 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-13 23:58:42,466 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:58:42,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:58:42,523 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:58:42,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:58:42 BoogieIcfgContainer [2024-10-13 23:58:42,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:58:42,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:58:42,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:58:42,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:58:42,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:58:37" (1/3) ... [2024-10-13 23:58:42,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3ef681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:58:42, skipping insertion in model container [2024-10-13 23:58:42,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:58:38" (2/3) ... [2024-10-13 23:58:42,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3ef681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:58:42, skipping insertion in model container [2024-10-13 23:58:42,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:58:42" (3/3) ... [2024-10-13 23:58:42,536 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label50.c [2024-10-13 23:58:42,552 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:58:42,552 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:58:42,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:58:42,650 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;@2e42c30b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:58:42,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:58:42,657 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-13 23:58:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 23:58:42,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:42,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:58:42,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:42,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:42,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1707121261, now seen corresponding path program 1 times [2024-10-13 23:58:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:42,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969091263] [2024-10-13 23:58:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:42,818 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-13 23:58:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969091263] [2024-10-13 23:58:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969091263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:58:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887670686] [2024-10-13 23:58:42,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:42,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:58:42,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:42,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:58:42,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:58:42,852 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-13 23:58:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:42,927 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-13 23:58:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:58:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-13 23:58:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:42,956 INFO L225 Difference]: With dead ends: 1055 [2024-10-13 23:58:42,956 INFO L226 Difference]: Without dead ends: 526 [2024-10-13 23:58:42,964 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-13 23:58:42,968 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-13 23:58:42,971 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-13 23:58:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-13 23:58:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-13 23:58:43,047 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-13 23:58:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-13 23:58:43,052 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 8 [2024-10-13 23:58:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:43,053 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-13 23:58:43,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-13 23:58:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-13 23:58:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 23:58:43,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:43,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:58:43,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:58:43,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:43,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1786186575, now seen corresponding path program 1 times [2024-10-13 23:58:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344925262] [2024-10-13 23:58:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:43,133 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-13 23:58:43,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:43,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344925262] [2024-10-13 23:58:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344925262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:43,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:43,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:58:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985257038] [2024-10-13 23:58:43,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:43,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:58:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:58:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:58:43,139 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-13 23:58:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:45,341 INFO L93 Difference]: Finished difference Result 1522 states and 2728 transitions. [2024-10-13 23:58:45,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:58:45,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-13 23:58:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:45,351 INFO L225 Difference]: With dead ends: 1522 [2024-10-13 23:58:45,354 INFO L226 Difference]: Without dead ends: 997 [2024-10-13 23:58:45,356 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-13 23:58:45,357 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 502 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:45,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 239 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 23:58:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-13 23:58:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 981. [2024-10-13 23:58:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.7081632653061225) internal successors, (1674), 980 states have internal predecessors, (1674), 0 states have call successors, (0), 0 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-13 23:58:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1674 transitions. [2024-10-13 23:58:45,415 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1674 transitions. Word has length 8 [2024-10-13 23:58:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:45,416 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1674 transitions. [2024-10-13 23:58:45,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-13 23:58:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1674 transitions. [2024-10-13 23:58:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 23:58:45,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:45,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:58:45,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:58:45,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:45,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1336788581, now seen corresponding path program 1 times [2024-10-13 23:58:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:45,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520113829] [2024-10-13 23:58:45,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:45,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:58:45,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:45,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520113829] [2024-10-13 23:58:45,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520113829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:45,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:45,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:58:45,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756031795] [2024-10-13 23:58:45,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:45,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:58:45,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:45,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:58:45,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:58:45,695 INFO L87 Difference]: Start difference. First operand 981 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:58:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:47,777 INFO L93 Difference]: Finished difference Result 2842 states and 4881 transitions. [2024-10-13 23:58:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:58:47,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-13 23:58:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:47,785 INFO L225 Difference]: With dead ends: 2842 [2024-10-13 23:58:47,785 INFO L226 Difference]: Without dead ends: 1862 [2024-10-13 23:58:47,788 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-13 23:58:47,790 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 409 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:47,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 493 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 23:58:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2024-10-13 23:58:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1856. [2024-10-13 23:58:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 1.4555256064690028) internal successors, (2700), 1855 states have internal predecessors, (2700), 0 states have call successors, (0), 0 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-13 23:58:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2700 transitions. [2024-10-13 23:58:47,834 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2700 transitions. Word has length 73 [2024-10-13 23:58:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:47,834 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2700 transitions. [2024-10-13 23:58:47,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:58:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2700 transitions. [2024-10-13 23:58:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 23:58:47,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:47,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:58:47,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:58:47,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:47,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1735328596, now seen corresponding path program 1 times [2024-10-13 23:58:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:47,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685702265] [2024-10-13 23:58:47,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:58:47,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:47,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685702265] [2024-10-13 23:58:47,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685702265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:47,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:47,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:58:47,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012835762] [2024-10-13 23:58:47,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:47,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:58:47,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:47,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:58:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:58:48,000 INFO L87 Difference]: Start difference. First operand 1856 states and 2700 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-13 23:58:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:50,045 INFO L93 Difference]: Finished difference Result 5424 states and 7894 transitions. [2024-10-13 23:58:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:58:50,045 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 79 [2024-10-13 23:58:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:50,058 INFO L225 Difference]: With dead ends: 5424 [2024-10-13 23:58:50,059 INFO L226 Difference]: Without dead ends: 3569 [2024-10-13 23:58:50,062 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-13 23:58:50,063 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 387 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 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, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:50,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 23:58:50,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2024-10-13 23:58:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 2713. [2024-10-13 23:58:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2712 states have (on average 1.3160029498525074) internal successors, (3569), 2712 states have internal predecessors, (3569), 0 states have call successors, (0), 0 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-13 23:58:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3569 transitions. [2024-10-13 23:58:50,117 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3569 transitions. Word has length 79 [2024-10-13 23:58:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:50,119 INFO L471 AbstractCegarLoop]: Abstraction has 2713 states and 3569 transitions. [2024-10-13 23:58:50,119 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-13 23:58:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3569 transitions. [2024-10-13 23:58:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 23:58:50,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:50,123 INFO L215 NwaCegarLoop]: trace histogram [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, 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-13 23:58:50,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:58:50,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:50,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash 548384388, now seen corresponding path program 1 times [2024-10-13 23:58:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:50,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675096692] [2024-10-13 23:58:50,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:50,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:58:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675096692] [2024-10-13 23:58:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675096692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:50,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:50,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:58:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661127459] [2024-10-13 23:58:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:50,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:58:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:58:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:58:50,450 INFO L87 Difference]: Start difference. First operand 2713 states and 3569 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-13 23:58:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:52,320 INFO L93 Difference]: Finished difference Result 7135 states and 9629 transitions. [2024-10-13 23:58:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:58:52,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-13 23:58:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:52,336 INFO L225 Difference]: With dead ends: 7135 [2024-10-13 23:58:52,337 INFO L226 Difference]: Without dead ends: 4423 [2024-10-13 23:58:52,342 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-13 23:58:52,343 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 500 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:52,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 814 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 23:58:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4423 states. [2024-10-13 23:58:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4423 to 4423. [2024-10-13 23:58:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4423 states, 4422 states have (on average 1.2912709181365898) internal successors, (5710), 4422 states have internal predecessors, (5710), 0 states have call successors, (0), 0 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-13 23:58:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 5710 transitions. [2024-10-13 23:58:52,413 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 5710 transitions. Word has length 156 [2024-10-13 23:58:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:52,413 INFO L471 AbstractCegarLoop]: Abstraction has 4423 states and 5710 transitions. [2024-10-13 23:58:52,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-13 23:58:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 5710 transitions. [2024-10-13 23:58:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 23:58:52,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:52,417 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:58:52,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:58:52,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:52,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:52,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1052501965, now seen corresponding path program 1 times [2024-10-13 23:58:52,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:52,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343903731] [2024-10-13 23:58:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:52,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-13 23:58:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343903731] [2024-10-13 23:58:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343903731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:52,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:52,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:58:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701975465] [2024-10-13 23:58:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:52,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:58:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:52,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:58:52,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:58:52,673 INFO L87 Difference]: Start difference. First operand 4423 states and 5710 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-13 23:58:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:54,525 INFO L93 Difference]: Finished difference Result 10592 states and 13803 transitions. [2024-10-13 23:58:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:58:54,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 162 [2024-10-13 23:58:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:54,545 INFO L225 Difference]: With dead ends: 10592 [2024-10-13 23:58:54,545 INFO L226 Difference]: Without dead ends: 6170 [2024-10-13 23:58:54,550 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-13 23:58:54,551 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 543 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:54,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 238 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 23:58:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2024-10-13 23:58:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 6152. [2024-10-13 23:58:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6152 states, 6151 states have (on average 1.3040156072183384) internal successors, (8021), 6151 states have internal predecessors, (8021), 0 states have call successors, (0), 0 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-13 23:58:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 8021 transitions. [2024-10-13 23:58:54,646 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 8021 transitions. Word has length 162 [2024-10-13 23:58:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:54,648 INFO L471 AbstractCegarLoop]: Abstraction has 6152 states and 8021 transitions. [2024-10-13 23:58:54,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-13 23:58:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 8021 transitions. [2024-10-13 23:58:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-13 23:58:54,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:54,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:58:54,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:58:54,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:54,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash 666670125, now seen corresponding path program 1 times [2024-10-13 23:58:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:54,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265965687] [2024-10-13 23:58:54,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:58:55,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265965687] [2024-10-13 23:58:55,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265965687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:58:55,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100687639] [2024-10-13 23:58:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:55,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:58:55,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:58:55,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:58:55,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:58:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:55,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:58:55,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:58:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:58:55,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 23:58:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:58:55,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100687639] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 23:58:55,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 23:58:55,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-13 23:58:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427410335] [2024-10-13 23:58:55,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:55,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:58:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:58:55,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:58:55,957 INFO L87 Difference]: Start difference. First operand 6152 states and 8021 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 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-13 23:58:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:59,509 INFO L93 Difference]: Finished difference Result 19167 states and 25207 transitions. [2024-10-13 23:58:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:58:59,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2024-10-13 23:58:59,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:59,541 INFO L225 Difference]: With dead ends: 19167 [2024-10-13 23:58:59,541 INFO L226 Difference]: Without dead ends: 11735 [2024-10-13 23:58:59,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:58:59,551 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 836 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2682 mSolverCounterSat, 1228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1228 IncrementalHoareTripleChecker+Valid, 2682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:59,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 153 Invalid, 3910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1228 Valid, 2682 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-13 23:58:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11735 states. [2024-10-13 23:58:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 11268. [2024-10-13 23:58:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11268 states, 11267 states have (on average 1.2258808910978964) internal successors, (13812), 11267 states have internal predecessors, (13812), 0 states have call successors, (0), 0 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-13 23:58:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13812 transitions. [2024-10-13 23:58:59,738 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13812 transitions. Word has length 228 [2024-10-13 23:58:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:59,739 INFO L471 AbstractCegarLoop]: Abstraction has 11268 states and 13812 transitions. [2024-10-13 23:58:59,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 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-13 23:58:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13812 transitions. [2024-10-13 23:58:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-13 23:58:59,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:59,743 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:58:59,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:58:59,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:58:59,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:59,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1661392239, now seen corresponding path program 1 times [2024-10-13 23:58:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:59,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881776398] [2024-10-13 23:58:59,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:59:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881776398] [2024-10-13 23:59:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881776398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004314572] [2024-10-13 23:59:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:00,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:00,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:00,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:00,137 INFO L87 Difference]: Start difference. First operand 11268 states and 13812 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-13 23:59:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:01,872 INFO L93 Difference]: Finished difference Result 28061 states and 34700 transitions. [2024-10-13 23:59:01,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:01,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 246 [2024-10-13 23:59:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:01,897 INFO L225 Difference]: With dead ends: 28061 [2024-10-13 23:59:01,897 INFO L226 Difference]: Without dead ends: 15066 [2024-10-13 23:59:01,913 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-13 23:59:01,914 INFO L432 NwaCegarLoop]: 640 mSDtfsCounter, 534 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:01,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 680 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:59:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15066 states. [2024-10-13 23:59:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15066 to 15062. [2024-10-13 23:59:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15062 states, 15061 states have (on average 1.1958037314919328) internal successors, (18010), 15061 states have internal predecessors, (18010), 0 states have call successors, (0), 0 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-13 23:59:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15062 states to 15062 states and 18010 transitions. [2024-10-13 23:59:02,114 INFO L78 Accepts]: Start accepts. Automaton has 15062 states and 18010 transitions. Word has length 246 [2024-10-13 23:59:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:02,115 INFO L471 AbstractCegarLoop]: Abstraction has 15062 states and 18010 transitions. [2024-10-13 23:59:02,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-13 23:59:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 15062 states and 18010 transitions. [2024-10-13 23:59:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-10-13 23:59:02,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:02,120 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:59:02,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:59:02,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:02,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:02,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1364942488, now seen corresponding path program 1 times [2024-10-13 23:59:02,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:02,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493526882] [2024-10-13 23:59:02,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:02,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:59:02,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:02,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493526882] [2024-10-13 23:59:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493526882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:02,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:02,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322259165] [2024-10-13 23:59:02,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:02,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:02,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:02,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:02,601 INFO L87 Difference]: Start difference. First operand 15062 states and 18010 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 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-13 23:59:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:04,287 INFO L93 Difference]: Finished difference Result 39938 states and 47576 transitions. [2024-10-13 23:59:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:04,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2024-10-13 23:59:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:04,329 INFO L225 Difference]: With dead ends: 39938 [2024-10-13 23:59:04,330 INFO L226 Difference]: Without dead ends: 24025 [2024-10-13 23:59:04,352 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-13 23:59:04,355 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 299 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:04,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 787 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:59:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24025 states. [2024-10-13 23:59:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24025 to 23590. [2024-10-13 23:59:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23590 states, 23589 states have (on average 1.1493068803255755) internal successors, (27111), 23589 states have internal predecessors, (27111), 0 states have call successors, (0), 0 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-13 23:59:04,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23590 states to 23590 states and 27111 transitions. [2024-10-13 23:59:04,785 INFO L78 Accepts]: Start accepts. Automaton has 23590 states and 27111 transitions. Word has length 265 [2024-10-13 23:59:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:04,785 INFO L471 AbstractCegarLoop]: Abstraction has 23590 states and 27111 transitions. [2024-10-13 23:59:04,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 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-13 23:59:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 23590 states and 27111 transitions. [2024-10-13 23:59:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-13 23:59:04,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:04,794 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:59:04,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:59:04,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:04,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash 336676864, now seen corresponding path program 1 times [2024-10-13 23:59:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:04,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454177605] [2024-10-13 23:59:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-13 23:59:05,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454177605] [2024-10-13 23:59:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454177605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778192849] [2024-10-13 23:59:05,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:05,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:05,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:05,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:05,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:05,240 INFO L87 Difference]: Start difference. First operand 23590 states and 27111 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-13 23:59:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:06,816 INFO L93 Difference]: Finished difference Result 54404 states and 62872 transitions. [2024-10-13 23:59:06,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:06,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 347 [2024-10-13 23:59:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:06,870 INFO L225 Difference]: With dead ends: 54404 [2024-10-13 23:59:06,870 INFO L226 Difference]: Without dead ends: 30815 [2024-10-13 23:59:06,887 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-13 23:59:06,888 INFO L432 NwaCegarLoop]: 720 mSDtfsCounter, 275 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:06,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 781 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:59:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30815 states. [2024-10-13 23:59:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30815 to 30390. [2024-10-13 23:59:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30390 states, 30389 states have (on average 1.1316594820494257) internal successors, (34390), 30389 states have internal predecessors, (34390), 0 states have call successors, (0), 0 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-13 23:59:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30390 states to 30390 states and 34390 transitions. [2024-10-13 23:59:07,197 INFO L78 Accepts]: Start accepts. Automaton has 30390 states and 34390 transitions. Word has length 347 [2024-10-13 23:59:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:07,198 INFO L471 AbstractCegarLoop]: Abstraction has 30390 states and 34390 transitions. [2024-10-13 23:59:07,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-13 23:59:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30390 states and 34390 transitions. [2024-10-13 23:59:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-10-13 23:59:07,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:07,208 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:59:07,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:59:07,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:07,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash -167361755, now seen corresponding path program 1 times [2024-10-13 23:59:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:07,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465219286] [2024-10-13 23:59:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:07,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:59:07,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:07,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465219286] [2024-10-13 23:59:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465219286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:07,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:07,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154802074] [2024-10-13 23:59:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:07,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:07,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:07,628 INFO L87 Difference]: Start difference. First operand 30390 states and 34390 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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-13 23:59:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:09,199 INFO L93 Difference]: Finished difference Result 71892 states and 81833 transitions. [2024-10-13 23:59:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 370 [2024-10-13 23:59:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:09,248 INFO L225 Difference]: With dead ends: 71892 [2024-10-13 23:59:09,249 INFO L226 Difference]: Without dead ends: 41503 [2024-10-13 23:59:09,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-13 23:59:09,274 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 334 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:09,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 664 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:59:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41503 states. [2024-10-13 23:59:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41503 to 40196. [2024-10-13 23:59:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40196 states, 40195 states have (on average 1.1419330762532653) internal successors, (45900), 40195 states have internal predecessors, (45900), 0 states have call successors, (0), 0 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-13 23:59:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40196 states to 40196 states and 45900 transitions. [2024-10-13 23:59:09,849 INFO L78 Accepts]: Start accepts. Automaton has 40196 states and 45900 transitions. Word has length 370 [2024-10-13 23:59:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:09,850 INFO L471 AbstractCegarLoop]: Abstraction has 40196 states and 45900 transitions. [2024-10-13 23:59:09,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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-13 23:59:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 40196 states and 45900 transitions. [2024-10-13 23:59:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-10-13 23:59:09,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:09,861 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:59:09,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:59:09,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash -810568491, now seen corresponding path program 1 times [2024-10-13 23:59:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243102065] [2024-10-13 23:59:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-13 23:59:10,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:10,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243102065] [2024-10-13 23:59:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243102065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:10,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:10,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:10,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988254094] [2024-10-13 23:59:10,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:10,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:10,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:10,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:10,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:10,350 INFO L87 Difference]: Start difference. First operand 40196 states and 45900 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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-13 23:59:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:12,063 INFO L93 Difference]: Finished difference Result 88515 states and 100808 transitions. [2024-10-13 23:59:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:12,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 371 [2024-10-13 23:59:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:12,112 INFO L225 Difference]: With dead ends: 88515 [2024-10-13 23:59:12,113 INFO L226 Difference]: Without dead ends: 47895 [2024-10-13 23:59:12,141 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-13 23:59:12,142 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 510 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:12,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 165 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:59:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47895 states. [2024-10-13 23:59:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47895 to 39341. [2024-10-13 23:59:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39341 states, 39340 states have (on average 1.143568886629385) internal successors, (44988), 39340 states have internal predecessors, (44988), 0 states have call successors, (0), 0 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-13 23:59:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39341 states to 39341 states and 44988 transitions. [2024-10-13 23:59:12,845 INFO L78 Accepts]: Start accepts. Automaton has 39341 states and 44988 transitions. Word has length 371 [2024-10-13 23:59:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:12,846 INFO L471 AbstractCegarLoop]: Abstraction has 39341 states and 44988 transitions. [2024-10-13 23:59:12,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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-13 23:59:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 39341 states and 44988 transitions. [2024-10-13 23:59:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-10-13 23:59:12,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:12,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:59:12,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:59:12,875 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:12,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1592160956, now seen corresponding path program 1 times [2024-10-13 23:59:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:12,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43818100] [2024-10-13 23:59:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:59:13,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:13,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43818100] [2024-10-13 23:59:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43818100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:13,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:13,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269427774] [2024-10-13 23:59:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:13,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:13,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:13,421 INFO L87 Difference]: Start difference. First operand 39341 states and 44988 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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-13 23:59:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:14,856 INFO L93 Difference]: Finished difference Result 77823 states and 89032 transitions. [2024-10-13 23:59:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:14,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-13 23:59:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:14,895 INFO L225 Difference]: With dead ends: 77823 [2024-10-13 23:59:14,895 INFO L226 Difference]: Without dead ends: 38482 [2024-10-13 23:59:14,912 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-13 23:59:14,913 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 496 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:14,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 720 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:59:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38482 states. [2024-10-13 23:59:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38482 to 37629. [2024-10-13 23:59:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37629 states, 37628 states have (on average 1.1056128415010098) internal successors, (41602), 37628 states have internal predecessors, (41602), 0 states have call successors, (0), 0 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-13 23:59:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37629 states to 37629 states and 41602 transitions. [2024-10-13 23:59:15,377 INFO L78 Accepts]: Start accepts. Automaton has 37629 states and 41602 transitions. Word has length 407 [2024-10-13 23:59:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:15,378 INFO L471 AbstractCegarLoop]: Abstraction has 37629 states and 41602 transitions. [2024-10-13 23:59:15,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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-13 23:59:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37629 states and 41602 transitions. [2024-10-13 23:59:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-10-13 23:59:15,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:15,386 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:59:15,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:59:15,387 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:15,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash -644490961, now seen corresponding path program 1 times [2024-10-13 23:59:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:15,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009710078] [2024-10-13 23:59:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:59:16,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:16,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009710078] [2024-10-13 23:59:16,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009710078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:16,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:16,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:16,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597786007] [2024-10-13 23:59:16,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:16,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:16,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:16,249 INFO L87 Difference]: Start difference. First operand 37629 states and 41602 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-13 23:59:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:17,726 INFO L93 Difference]: Finished difference Result 81658 states and 90641 transitions. [2024-10-13 23:59:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 413 [2024-10-13 23:59:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:17,777 INFO L225 Difference]: With dead ends: 81658 [2024-10-13 23:59:17,777 INFO L226 Difference]: Without dead ends: 44030 [2024-10-13 23:59:17,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:17,804 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 293 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:17,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 773 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:59:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44030 states. [2024-10-13 23:59:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44030 to 44023. [2024-10-13 23:59:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44023 states, 44022 states have (on average 1.105674435509518) internal successors, (48674), 44022 states have internal predecessors, (48674), 0 states have call successors, (0), 0 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-13 23:59:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44023 states to 44023 states and 48674 transitions. [2024-10-13 23:59:18,282 INFO L78 Accepts]: Start accepts. Automaton has 44023 states and 48674 transitions. Word has length 413 [2024-10-13 23:59:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:18,283 INFO L471 AbstractCegarLoop]: Abstraction has 44023 states and 48674 transitions. [2024-10-13 23:59:18,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-13 23:59:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 44023 states and 48674 transitions. [2024-10-13 23:59:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-10-13 23:59:18,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:18,294 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:59:18,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:59:18,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:18,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash -820996475, now seen corresponding path program 1 times [2024-10-13 23:59:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:18,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498338384] [2024-10-13 23:59:18,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:59:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498338384] [2024-10-13 23:59:18,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498338384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:18,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:18,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:18,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730019086] [2024-10-13 23:59:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:18,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:18,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:18,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:18,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:18,793 INFO L87 Difference]: Start difference. First operand 44023 states and 48674 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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-13 23:59:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:20,716 INFO L93 Difference]: Finished difference Result 107631 states and 119356 transitions. [2024-10-13 23:59:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:20,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 439 [2024-10-13 23:59:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:20,790 INFO L225 Difference]: With dead ends: 107631 [2024-10-13 23:59:20,790 INFO L226 Difference]: Without dead ends: 63608 [2024-10-13 23:59:20,826 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-13 23:59:20,826 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 504 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:20,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 294 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:59:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63608 states. [2024-10-13 23:59:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63608 to 60606. [2024-10-13 23:59:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60606 states, 60605 states have (on average 1.104776833594588) internal successors, (66955), 60605 states have internal predecessors, (66955), 0 states have call successors, (0), 0 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-13 23:59:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60606 states to 60606 states and 66955 transitions. [2024-10-13 23:59:21,679 INFO L78 Accepts]: Start accepts. Automaton has 60606 states and 66955 transitions. Word has length 439 [2024-10-13 23:59:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:21,680 INFO L471 AbstractCegarLoop]: Abstraction has 60606 states and 66955 transitions. [2024-10-13 23:59:21,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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-13 23:59:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 60606 states and 66955 transitions. [2024-10-13 23:59:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2024-10-13 23:59:21,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:21,687 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:59:21,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:59:21,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:21,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2029567293, now seen corresponding path program 1 times [2024-10-13 23:59:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:21,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922893257] [2024-10-13 23:59:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:59:22,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:22,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922893257] [2024-10-13 23:59:22,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922893257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:22,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:22,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:22,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043704373] [2024-10-13 23:59:22,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:22,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:22,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:22,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:22,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:22,209 INFO L87 Difference]: Start difference. First operand 60606 states and 66955 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-13 23:59:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:23,953 INFO L93 Difference]: Finished difference Result 135688 states and 149733 transitions. [2024-10-13 23:59:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:23,953 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 441 [2024-10-13 23:59:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:24,038 INFO L225 Difference]: With dead ends: 135688 [2024-10-13 23:59:24,038 INFO L226 Difference]: Without dead ends: 75083 [2024-10-13 23:59:24,064 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-13 23:59:24,065 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 291 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:24,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 389 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:59:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75083 states. [2024-10-13 23:59:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75083 to 71663. [2024-10-13 23:59:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71663 states, 71662 states have (on average 1.0993692612542212) internal successors, (78783), 71662 states have internal predecessors, (78783), 0 states have call successors, (0), 0 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-13 23:59:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71663 states to 71663 states and 78783 transitions. [2024-10-13 23:59:24,955 INFO L78 Accepts]: Start accepts. Automaton has 71663 states and 78783 transitions. Word has length 441 [2024-10-13 23:59:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:24,956 INFO L471 AbstractCegarLoop]: Abstraction has 71663 states and 78783 transitions. [2024-10-13 23:59:24,956 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-13 23:59:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 71663 states and 78783 transitions. [2024-10-13 23:59:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-10-13 23:59:24,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:24,966 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:59:24,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:59:24,966 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:24,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1017192003, now seen corresponding path program 1 times [2024-10-13 23:59:24,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:24,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575793008] [2024-10-13 23:59:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 281 proven. 82 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 23:59:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575793008] [2024-10-13 23:59:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575793008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:59:25,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594810317] [2024-10-13 23:59:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:25,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:59:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:59:25,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:59:25,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:59:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:25,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 23:59:25,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:59:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 206 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:59:26,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 23:59:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:59:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594810317] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 23:59:26,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 23:59:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2024-10-13 23:59:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063918545] [2024-10-13 23:59:26,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:26,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 23:59:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:26,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 23:59:26,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:59:26,992 INFO L87 Difference]: Start difference. First operand 71663 states and 78783 transitions. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 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-13 23:59:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:29,744 INFO L93 Difference]: Finished difference Result 159946 states and 176111 transitions. [2024-10-13 23:59:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:59:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 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 478 [2024-10-13 23:59:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:29,842 INFO L225 Difference]: With dead ends: 159946 [2024-10-13 23:59:29,842 INFO L226 Difference]: Without dead ends: 86157 [2024-10-13 23:59:29,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 951 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:59:29,863 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1060 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2086 mSolverCounterSat, 1086 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1086 IncrementalHoareTripleChecker+Valid, 2086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:29,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 135 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1086 Valid, 2086 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 23:59:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86157 states. [2024-10-13 23:59:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86157 to 79350. [2024-10-13 23:59:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79350 states, 79349 states have (on average 1.1009716568576793) internal successors, (87361), 79349 states have internal predecessors, (87361), 0 states have call successors, (0), 0 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-13 23:59:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79350 states to 79350 states and 87361 transitions. [2024-10-13 23:59:31,016 INFO L78 Accepts]: Start accepts. Automaton has 79350 states and 87361 transitions. Word has length 478 [2024-10-13 23:59:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:31,016 INFO L471 AbstractCegarLoop]: Abstraction has 79350 states and 87361 transitions. [2024-10-13 23:59:31,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 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-13 23:59:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 79350 states and 87361 transitions. [2024-10-13 23:59:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-13 23:59:31,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:31,026 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:59:31,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 23:59:31,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 23:59:31,227 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:31,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash -760108143, now seen corresponding path program 1 times [2024-10-13 23:59:31,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:31,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182045746] [2024-10-13 23:59:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-13 23:59:31,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182045746] [2024-10-13 23:59:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182045746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808781936] [2024-10-13 23:59:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:31,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:31,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:31,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:31,618 INFO L87 Difference]: Start difference. First operand 79350 states and 87361 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-13 23:59:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:33,533 INFO L93 Difference]: Finished difference Result 169782 states and 186844 transitions. [2024-10-13 23:59:33,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:33,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 490 [2024-10-13 23:59:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:33,646 INFO L225 Difference]: With dead ends: 169782 [2024-10-13 23:59:33,646 INFO L226 Difference]: Without dead ends: 90433 [2024-10-13 23:59:33,703 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-13 23:59:33,704 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 298 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:33,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 393 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:59:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90433 states. [2024-10-13 23:59:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90433 to 77650. [2024-10-13 23:59:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77650 states, 77649 states have (on average 1.0979793686976007) internal successors, (85257), 77649 states have internal predecessors, (85257), 0 states have call successors, (0), 0 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-13 23:59:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77650 states to 77650 states and 85257 transitions. [2024-10-13 23:59:35,055 INFO L78 Accepts]: Start accepts. Automaton has 77650 states and 85257 transitions. Word has length 490 [2024-10-13 23:59:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:35,056 INFO L471 AbstractCegarLoop]: Abstraction has 77650 states and 85257 transitions. [2024-10-13 23:59:35,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-13 23:59:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 77650 states and 85257 transitions. [2024-10-13 23:59:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2024-10-13 23:59:35,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:35,080 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:59:35,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:59:35,080 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:35,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1987967215, now seen corresponding path program 1 times [2024-10-13 23:59:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:35,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047538644] [2024-10-13 23:59:35,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-13 23:59:35,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047538644] [2024-10-13 23:59:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047538644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:35,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:35,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:59:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922723042] [2024-10-13 23:59:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:35,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:35,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:35,461 INFO L87 Difference]: Start difference. First operand 77650 states and 85257 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 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-13 23:59:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:36,534 INFO L93 Difference]: Finished difference Result 151030 states and 165742 transitions. [2024-10-13 23:59:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 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 501 [2024-10-13 23:59:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:36,946 INFO L225 Difference]: With dead ends: 151030 [2024-10-13 23:59:36,946 INFO L226 Difference]: Without dead ends: 73381 [2024-10-13 23:59:36,966 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-13 23:59:36,967 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 620 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:36,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 100 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:59:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73381 states. [2024-10-13 23:59:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73381 to 72940. [2024-10-13 23:59:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72940 states, 72939 states have (on average 1.0967795006786494) internal successors, (79998), 72939 states have internal predecessors, (79998), 0 states have call successors, (0), 0 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-13 23:59:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72940 states to 72940 states and 79998 transitions. [2024-10-13 23:59:37,983 INFO L78 Accepts]: Start accepts. Automaton has 72940 states and 79998 transitions. Word has length 501 [2024-10-13 23:59:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:37,984 INFO L471 AbstractCegarLoop]: Abstraction has 72940 states and 79998 transitions. [2024-10-13 23:59:37,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 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-13 23:59:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 72940 states and 79998 transitions. [2024-10-13 23:59:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2024-10-13 23:59:38,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:38,004 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:59:38,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:59:38,004 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:38,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:38,006 INFO L85 PathProgramCache]: Analyzing trace with hash -519654894, now seen corresponding path program 1 times [2024-10-13 23:59:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:38,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962834508] [2024-10-13 23:59:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:38,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-13 23:59:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962834508] [2024-10-13 23:59:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962834508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:38,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:59:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098856165] [2024-10-13 23:59:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:38,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:59:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:59:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:59:38,290 INFO L87 Difference]: Start difference. First operand 72940 states and 79998 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 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-13 23:59:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:40,829 INFO L93 Difference]: Finished difference Result 170578 states and 187479 transitions. [2024-10-13 23:59:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:59:40,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 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 513 [2024-10-13 23:59:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:40,944 INFO L225 Difference]: With dead ends: 170578 [2024-10-13 23:59:40,944 INFO L226 Difference]: Without dead ends: 97639 [2024-10-13 23:59:40,991 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-13 23:59:40,991 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 788 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:40,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 278 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 23:59:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97639 states. [2024-10-13 23:59:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97639 to 86965. [2024-10-13 23:59:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86965 states, 86964 states have (on average 1.0869785198472932) internal successors, (94528), 86964 states have internal predecessors, (94528), 0 states have call successors, (0), 0 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-13 23:59:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86965 states to 86965 states and 94528 transitions. [2024-10-13 23:59:42,256 INFO L78 Accepts]: Start accepts. Automaton has 86965 states and 94528 transitions. Word has length 513 [2024-10-13 23:59:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:42,257 INFO L471 AbstractCegarLoop]: Abstraction has 86965 states and 94528 transitions. [2024-10-13 23:59:42,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 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-13 23:59:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 86965 states and 94528 transitions. [2024-10-13 23:59:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2024-10-13 23:59:42,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:42,271 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:59:42,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:59:42,272 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2040420936, now seen corresponding path program 1 times [2024-10-13 23:59:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:42,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799278160] [2024-10-13 23:59:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-13 23:59:42,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799278160] [2024-10-13 23:59:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799278160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:42,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:42,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854496663] [2024-10-13 23:59:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:42,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:42,980 INFO L87 Difference]: Start difference. First operand 86965 states and 94528 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-13 23:59:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:44,591 INFO L93 Difference]: Finished difference Result 179460 states and 194954 transitions. [2024-10-13 23:59:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:59:44,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 517 [2024-10-13 23:59:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:44,702 INFO L225 Difference]: With dead ends: 179460 [2024-10-13 23:59:44,702 INFO L226 Difference]: Without dead ends: 92496 [2024-10-13 23:59:44,753 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-13 23:59:44,754 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 271 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:44,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 322 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:59:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92496 states. [2024-10-13 23:59:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92496 to 83134. [2024-10-13 23:59:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83134 states, 83133 states have (on average 1.0868728423129204) internal successors, (90355), 83133 states have internal predecessors, (90355), 0 states have call successors, (0), 0 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-13 23:59:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83134 states to 83134 states and 90355 transitions. [2024-10-13 23:59:45,831 INFO L78 Accepts]: Start accepts. Automaton has 83134 states and 90355 transitions. Word has length 517 [2024-10-13 23:59:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:45,832 INFO L471 AbstractCegarLoop]: Abstraction has 83134 states and 90355 transitions. [2024-10-13 23:59:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-13 23:59:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 83134 states and 90355 transitions. [2024-10-13 23:59:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2024-10-13 23:59:45,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:45,841 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:59:45,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 23:59:45,841 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:45,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1009034161, now seen corresponding path program 1 times [2024-10-13 23:59:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452514168] [2024-10-13 23:59:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-13 23:59:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:46,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452514168] [2024-10-13 23:59:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452514168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:46,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:59:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514097196] [2024-10-13 23:59:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:46,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:59:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:46,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:59:46,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:59:46,466 INFO L87 Difference]: Start difference. First operand 83134 states and 90355 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 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-13 23:59:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:59:49,005 INFO L93 Difference]: Finished difference Result 178643 states and 193855 transitions. [2024-10-13 23:59:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:59:49,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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 519 [2024-10-13 23:59:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:59:49,115 INFO L225 Difference]: With dead ends: 178643 [2024-10-13 23:59:49,115 INFO L226 Difference]: Without dead ends: 95510 [2024-10-13 23:59:49,156 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-13 23:59:49,156 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 796 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:59:49,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 281 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 23:59:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95510 states. [2024-10-13 23:59:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95510 to 83136. [2024-10-13 23:59:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83136 states, 83135 states have (on average 1.0868707523906898) internal successors, (90357), 83135 states have internal predecessors, (90357), 0 states have call successors, (0), 0 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-13 23:59:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83136 states to 83136 states and 90357 transitions. [2024-10-13 23:59:50,535 INFO L78 Accepts]: Start accepts. Automaton has 83136 states and 90357 transitions. Word has length 519 [2024-10-13 23:59:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:59:50,535 INFO L471 AbstractCegarLoop]: Abstraction has 83136 states and 90357 transitions. [2024-10-13 23:59:50,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 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-13 23:59:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 83136 states and 90357 transitions. [2024-10-13 23:59:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2024-10-13 23:59:50,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:59:50,549 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 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-13 23:59:50,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 23:59:50,549 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:59:50,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:59:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1752973169, now seen corresponding path program 1 times [2024-10-13 23:59:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:59:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642052391] [2024-10-13 23:59:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:59:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:59:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:59:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:59:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:59:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642052391] [2024-10-13 23:59:50,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642052391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:59:50,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:59:50,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:59:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284006850] [2024-10-13 23:59:50,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:59:50,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:59:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:59:50,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:59:50,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:59:50,741 INFO L87 Difference]: Start difference. First operand 83136 states and 90357 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)