./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.ufo.BOUNDED-10.pals.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/seq-mthreaded/pals_opt-floodmax.5.ufo.BOUNDED-10.pals.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 862a22b06127bdc98ab5e83db22f5f2cf328c0994e69e0861a4fa89f35122e73 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:36:40,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:36:41,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:36:41,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:36:41,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:36:41,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:36:41,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:36:41,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:36:41,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:36:41,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:36:41,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:36:41,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:36:41,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:36:41,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:36:41,077 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:36:41,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:36:41,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:36:41,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:36:41,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:36:41,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:36:41,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:36:41,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:36:41,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:36:41,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:36:41,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:36:41,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:36:41,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:36:41,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:36:41,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:36:41,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:36:41,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:36:41,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:36:41,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:36:41,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:36:41,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:36:41,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:36:41,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:36:41,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:36:41,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:36:41,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:36:41,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:36:41,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:36:41,088 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 -> 862a22b06127bdc98ab5e83db22f5f2cf328c0994e69e0861a4fa89f35122e73 [2024-10-14 03:36:41,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:36:41,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:36:41,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:36:41,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:36:41,410 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:36:41,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.ufo.BOUNDED-10.pals.c [2024-10-14 03:36:42,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:36:43,220 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:36:43,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.ufo.BOUNDED-10.pals.c [2024-10-14 03:36:43,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141b1aa4b/d4f4cc6e33f8444f8b923813a8ec46e1/FLAG700ec43e7 [2024-10-14 03:36:43,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141b1aa4b/d4f4cc6e33f8444f8b923813a8ec46e1 [2024-10-14 03:36:43,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:36:43,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:36:43,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:36:43,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:36:43,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:36:43,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:43,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69516577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43, skipping insertion in model container [2024-10-14 03:36:43,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:43,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:36:43,771 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.ufo.BOUNDED-10.pals.c[65469,65482] [2024-10-14 03:36:43,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:36:43,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:36:43,918 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.ufo.BOUNDED-10.pals.c[65469,65482] [2024-10-14 03:36:43,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:36:43,945 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:36:43,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43 WrapperNode [2024-10-14 03:36:43,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:36:43,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:36:43,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:36:43,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:36:43,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:43,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,078 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2140 [2024-10-14 03:36:44,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:36:44,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:36:44,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:36:44,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:36:44,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,153 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-14 03:36:44,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:36:44,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:36:44,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:36:44,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:36:44,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (1/1) ... [2024-10-14 03:36:44,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:36:44,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:36:44,285 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-14 03:36:44,288 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-14 03:36:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:36:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:36:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:36:44,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:36:44,550 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:36:44,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:36:46,559 INFO L? ?]: Removed 240 outVars from TransFormulas that were not future-live. [2024-10-14 03:36:46,560 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:36:46,666 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:36:46,668 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:36:46,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:36:46 BoogieIcfgContainer [2024-10-14 03:36:46,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:36:46,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:36:46,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:36:46,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:36:46,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:36:43" (1/3) ... [2024-10-14 03:36:46,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50334879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:36:46, skipping insertion in model container [2024-10-14 03:36:46,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:36:43" (2/3) ... [2024-10-14 03:36:46,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50334879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:36:46, skipping insertion in model container [2024-10-14 03:36:46,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:36:46" (3/3) ... [2024-10-14 03:36:46,679 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.ufo.BOUNDED-10.pals.c [2024-10-14 03:36:46,695 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:36:46,695 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:36:46,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:36:46,806 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;@2e64371d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:36:46,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:36:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 691 states, 689 states have (on average 1.876632801161103) internal successors, (1293), 690 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:36:46,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:46,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:46,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:46,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash 213064800, now seen corresponding path program 1 times [2024-10-14 03:36:46,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:46,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248160576] [2024-10-14 03:36:46,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:47,659 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-14 03:36:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248160576] [2024-10-14 03:36:47,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248160576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:47,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:47,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:36:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592887034] [2024-10-14 03:36:47,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:47,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:36:47,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:47,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:36:47,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:36:47,701 INFO L87 Difference]: Start difference. First operand has 691 states, 689 states have (on average 1.876632801161103) internal successors, (1293), 690 states have internal predecessors, (1293), 0 states have call successors, (0), 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 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:47,907 INFO L93 Difference]: Finished difference Result 834 states and 1552 transitions. [2024-10-14 03:36:47,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:36:47,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-14 03:36:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:47,937 INFO L225 Difference]: With dead ends: 834 [2024-10-14 03:36:47,938 INFO L226 Difference]: Without dead ends: 689 [2024-10-14 03:36:47,943 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-14 03:36:47,947 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:47,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1286 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:36:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-14 03:36:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2024-10-14 03:36:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.872093023255814) internal successors, (1288), 688 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1288 transitions. [2024-10-14 03:36:48,118 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1288 transitions. Word has length 150 [2024-10-14 03:36:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:48,119 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1288 transitions. [2024-10-14 03:36:48,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1288 transitions. [2024-10-14 03:36:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:36:48,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:48,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:48,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:36:48,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:48,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2136292834, now seen corresponding path program 1 times [2024-10-14 03:36:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:48,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402317376] [2024-10-14 03:36:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:48,670 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-14 03:36:48,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:48,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402317376] [2024-10-14 03:36:48,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402317376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:48,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:48,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:36:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443967098] [2024-10-14 03:36:48,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:48,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:36:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:48,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:36:48,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:36:48,678 INFO L87 Difference]: Start difference. First operand 689 states and 1288 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:48,897 INFO L93 Difference]: Finished difference Result 832 states and 1545 transitions. [2024-10-14 03:36:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:36:48,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-14 03:36:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:48,905 INFO L225 Difference]: With dead ends: 832 [2024-10-14 03:36:48,905 INFO L226 Difference]: Without dead ends: 689 [2024-10-14 03:36:48,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:36:48,907 INFO L432 NwaCegarLoop]: 1285 mSDtfsCounter, 0 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3787 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:48,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3787 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:36:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-14 03:36:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2024-10-14 03:36:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.7776162790697674) internal successors, (1223), 688 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1223 transitions. [2024-10-14 03:36:48,937 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1223 transitions. Word has length 150 [2024-10-14 03:36:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:48,938 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1223 transitions. [2024-10-14 03:36:48,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1223 transitions. [2024-10-14 03:36:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-14 03:36:48,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:48,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:48,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:36:48,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:48,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1498037184, now seen corresponding path program 1 times [2024-10-14 03:36:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932092916] [2024-10-14 03:36:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:49,298 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-14 03:36:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932092916] [2024-10-14 03:36:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932092916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:49,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:49,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:36:49,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328231221] [2024-10-14 03:36:49,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:49,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:36:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:49,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:36:49,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:36:49,306 INFO L87 Difference]: Start difference. First operand 689 states and 1223 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:49,494 INFO L93 Difference]: Finished difference Result 955 states and 1705 transitions. [2024-10-14 03:36:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:36:49,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2024-10-14 03:36:49,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:49,501 INFO L225 Difference]: With dead ends: 955 [2024-10-14 03:36:49,501 INFO L226 Difference]: Without dead ends: 815 [2024-10-14 03:36:49,502 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-14 03:36:49,505 INFO L432 NwaCegarLoop]: 1219 mSDtfsCounter, 220 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:49,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2374 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:36:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-10-14 03:36:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 813. [2024-10-14 03:36:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 812 states have (on average 1.7795566502463054) internal successors, (1445), 812 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1445 transitions. [2024-10-14 03:36:49,529 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1445 transitions. Word has length 214 [2024-10-14 03:36:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:49,531 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1445 transitions. [2024-10-14 03:36:49,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1445 transitions. [2024-10-14 03:36:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-14 03:36:49,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:49,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:36:49,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 843594662, now seen corresponding path program 1 times [2024-10-14 03:36:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062443670] [2024-10-14 03:36:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:49,857 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-14 03:36:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062443670] [2024-10-14 03:36:49,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062443670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:49,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:49,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:36:49,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737012266] [2024-10-14 03:36:49,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:49,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:36:49,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:49,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:36:49,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:36:49,860 INFO L87 Difference]: Start difference. First operand 813 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:50,061 INFO L93 Difference]: Finished difference Result 1317 states and 2353 transitions. [2024-10-14 03:36:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:36:50,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2024-10-14 03:36:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:50,067 INFO L225 Difference]: With dead ends: 1317 [2024-10-14 03:36:50,067 INFO L226 Difference]: Without dead ends: 1053 [2024-10-14 03:36:50,068 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-14 03:36:50,069 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 220 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:50,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2382 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:36:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-10-14 03:36:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1051. [2024-10-14 03:36:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.7847619047619048) internal successors, (1874), 1050 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1874 transitions. [2024-10-14 03:36:50,096 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1874 transitions. Word has length 218 [2024-10-14 03:36:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:50,097 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1874 transitions. [2024-10-14 03:36:50,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1874 transitions. [2024-10-14 03:36:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 03:36:50,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:50,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:50,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:36:50,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:50,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1319265996, now seen corresponding path program 1 times [2024-10-14 03:36:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780162677] [2024-10-14 03:36:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:50,388 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-14 03:36:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780162677] [2024-10-14 03:36:50,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780162677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:50,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:36:50,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986997193] [2024-10-14 03:36:50,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:50,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:36:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:50,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:36:50,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:36:50,395 INFO L87 Difference]: Start difference. First operand 1051 states and 1874 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:50,570 INFO L93 Difference]: Finished difference Result 2007 states and 3596 transitions. [2024-10-14 03:36:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:36:50,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2024-10-14 03:36:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:50,577 INFO L225 Difference]: With dead ends: 2007 [2024-10-14 03:36:50,577 INFO L226 Difference]: Without dead ends: 1505 [2024-10-14 03:36:50,578 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-14 03:36:50,581 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 212 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:50,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 2383 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:36:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-14 03:36:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2024-10-14 03:36:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1502 states have (on average 1.7882822902796272) internal successors, (2686), 1502 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2686 transitions. [2024-10-14 03:36:50,620 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2686 transitions. Word has length 222 [2024-10-14 03:36:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:50,621 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 2686 transitions. [2024-10-14 03:36:50,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2686 transitions. [2024-10-14 03:36:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-14 03:36:50,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:50,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:50,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:36:50,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:50,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1204960562, now seen corresponding path program 1 times [2024-10-14 03:36:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:50,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712228952] [2024-10-14 03:36:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:50,962 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-14 03:36:50,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:50,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712228952] [2024-10-14 03:36:50,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712228952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:50,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:50,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:36:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108599338] [2024-10-14 03:36:50,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:50,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:36:50,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:50,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:36:50,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:36:50,965 INFO L87 Difference]: Start difference. First operand 1503 states and 2686 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:51,150 INFO L93 Difference]: Finished difference Result 3315 states and 5944 transitions. [2024-10-14 03:36:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:36:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2024-10-14 03:36:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:51,163 INFO L225 Difference]: With dead ends: 3315 [2024-10-14 03:36:51,164 INFO L226 Difference]: Without dead ends: 2361 [2024-10-14 03:36:51,166 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-14 03:36:51,168 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 204 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:51,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 2384 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:36:51,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-10-14 03:36:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2359. [2024-10-14 03:36:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2358 states have (on average 1.7888040712468194) internal successors, (4218), 2358 states have internal predecessors, (4218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4218 transitions. [2024-10-14 03:36:51,232 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4218 transitions. Word has length 226 [2024-10-14 03:36:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:51,235 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 4218 transitions. [2024-10-14 03:36:51,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4218 transitions. [2024-10-14 03:36:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-14 03:36:51,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:51,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:51,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:36:51,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:51,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash -870236456, now seen corresponding path program 1 times [2024-10-14 03:36:51,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:51,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513307622] [2024-10-14 03:36:51,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:51,523 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-14 03:36:51,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:51,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513307622] [2024-10-14 03:36:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513307622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:51,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:51,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:36:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322058297] [2024-10-14 03:36:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:51,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:36:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:51,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:36:51,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:36:51,527 INFO L87 Difference]: Start difference. First operand 2359 states and 4218 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:51,752 INFO L93 Difference]: Finished difference Result 5787 states and 10364 transitions. [2024-10-14 03:36:51,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:36:51,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2024-10-14 03:36:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:51,769 INFO L225 Difference]: With dead ends: 5787 [2024-10-14 03:36:51,769 INFO L226 Difference]: Without dead ends: 3977 [2024-10-14 03:36:51,776 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-14 03:36:51,777 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 196 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:51,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 2385 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:36:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2024-10-14 03:36:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3975. [2024-10-14 03:36:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3974 states have (on average 1.78610971313538) internal successors, (7098), 3974 states have internal predecessors, (7098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7098 transitions. [2024-10-14 03:36:51,889 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7098 transitions. Word has length 230 [2024-10-14 03:36:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:51,890 INFO L471 AbstractCegarLoop]: Abstraction has 3975 states and 7098 transitions. [2024-10-14 03:36:51,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7098 transitions. [2024-10-14 03:36:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-14 03:36:51,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:51,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:51,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:36:51,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash -22484034, now seen corresponding path program 1 times [2024-10-14 03:36:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881297085] [2024-10-14 03:36:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:52,324 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-14 03:36:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:52,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881297085] [2024-10-14 03:36:52,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881297085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:52,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:52,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:36:52,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608624106] [2024-10-14 03:36:52,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:52,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:36:52,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:52,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:36:52,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:36:52,327 INFO L87 Difference]: Start difference. First operand 3975 states and 7098 transitions. Second operand has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:53,191 INFO L93 Difference]: Finished difference Result 23595 states and 42436 transitions. [2024-10-14 03:36:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:36:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2024-10-14 03:36:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:53,277 INFO L225 Difference]: With dead ends: 23595 [2024-10-14 03:36:53,277 INFO L226 Difference]: Without dead ends: 20169 [2024-10-14 03:36:53,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:36:53,290 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 2614 mSDsluCounter, 10161 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2614 SdHoareTripleChecker+Valid, 11376 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:53,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2614 Valid, 11376 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:36:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20169 states. [2024-10-14 03:36:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20169 to 7263. [2024-10-14 03:36:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7263 states, 7262 states have (on average 1.786422473147893) internal successors, (12973), 7262 states have internal predecessors, (12973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7263 states to 7263 states and 12973 transitions. [2024-10-14 03:36:53,629 INFO L78 Accepts]: Start accepts. Automaton has 7263 states and 12973 transitions. Word has length 234 [2024-10-14 03:36:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:53,629 INFO L471 AbstractCegarLoop]: Abstraction has 7263 states and 12973 transitions. [2024-10-14 03:36:53,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 7263 states and 12973 transitions. [2024-10-14 03:36:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-14 03:36:53,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:53,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:53,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:36:53,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:53,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:53,638 INFO L85 PathProgramCache]: Analyzing trace with hash -770747648, now seen corresponding path program 1 times [2024-10-14 03:36:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:53,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886075027] [2024-10-14 03:36:53,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:54,001 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-14 03:36:54,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:54,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886075027] [2024-10-14 03:36:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886075027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:54,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:54,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:36:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383983373] [2024-10-14 03:36:54,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:54,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:36:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:54,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:36:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:36:54,005 INFO L87 Difference]: Start difference. First operand 7263 states and 12973 transitions. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:54,313 INFO L93 Difference]: Finished difference Result 21097 states and 37841 transitions. [2024-10-14 03:36:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:36:54,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2024-10-14 03:36:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:54,353 INFO L225 Difference]: With dead ends: 21097 [2024-10-14 03:36:54,353 INFO L226 Difference]: Without dead ends: 14383 [2024-10-14 03:36:54,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:36:54,370 INFO L432 NwaCegarLoop]: 1216 mSDtfsCounter, 732 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 3832 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:54,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 3832 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:36:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14383 states. [2024-10-14 03:36:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14383 to 10790. [2024-10-14 03:36:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10790 states, 10789 states have (on average 1.7870052831587728) internal successors, (19280), 10789 states have internal predecessors, (19280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10790 states to 10790 states and 19280 transitions. [2024-10-14 03:36:54,781 INFO L78 Accepts]: Start accepts. Automaton has 10790 states and 19280 transitions. Word has length 235 [2024-10-14 03:36:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:54,790 INFO L471 AbstractCegarLoop]: Abstraction has 10790 states and 19280 transitions. [2024-10-14 03:36:54,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10790 states and 19280 transitions. [2024-10-14 03:36:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-14 03:36:54,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:54,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:54,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:36:54,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:54,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:54,808 INFO L85 PathProgramCache]: Analyzing trace with hash 757143896, now seen corresponding path program 1 times [2024-10-14 03:36:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:54,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554393327] [2024-10-14 03:36:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:54,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:55,042 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-14 03:36:55,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:55,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554393327] [2024-10-14 03:36:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554393327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:55,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:36:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970446498] [2024-10-14 03:36:55,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:55,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:36:55,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:55,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:36:55,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:36:55,047 INFO L87 Difference]: Start difference. First operand 10790 states and 19280 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:55,303 INFO L93 Difference]: Finished difference Result 23791 states and 42624 transitions. [2024-10-14 03:36:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:36:55,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-10-14 03:36:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:55,344 INFO L225 Difference]: With dead ends: 23791 [2024-10-14 03:36:55,345 INFO L226 Difference]: Without dead ends: 16614 [2024-10-14 03:36:55,360 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-14 03:36:55,361 INFO L432 NwaCegarLoop]: 1419 mSDtfsCounter, 229 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:55,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 2605 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:36:55,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16614 states. [2024-10-14 03:36:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16614 to 16612. [2024-10-14 03:36:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16612 states, 16611 states have (on average 1.7836373487448076) internal successors, (29628), 16611 states have internal predecessors, (29628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16612 states to 16612 states and 29628 transitions. [2024-10-14 03:36:55,836 INFO L78 Accepts]: Start accepts. Automaton has 16612 states and 29628 transitions. Word has length 236 [2024-10-14 03:36:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:55,837 INFO L471 AbstractCegarLoop]: Abstraction has 16612 states and 29628 transitions. [2024-10-14 03:36:55,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 16612 states and 29628 transitions. [2024-10-14 03:36:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-14 03:36:55,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:55,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:55,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:36:55,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:55,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1595409544, now seen corresponding path program 1 times [2024-10-14 03:36:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:55,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188249933] [2024-10-14 03:36:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:55,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:56,036 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-14 03:36:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188249933] [2024-10-14 03:36:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188249933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:56,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:56,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:36:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123564672] [2024-10-14 03:36:56,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:56,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:36:56,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:56,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:36:56,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:36:56,040 INFO L87 Difference]: Start difference. First operand 16612 states and 29628 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:56,397 INFO L93 Difference]: Finished difference Result 32116 states and 57267 transitions. [2024-10-14 03:36:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:36:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-10-14 03:36:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:56,447 INFO L225 Difference]: With dead ends: 32116 [2024-10-14 03:36:56,447 INFO L226 Difference]: Without dead ends: 23490 [2024-10-14 03:36:56,461 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-14 03:36:56,462 INFO L432 NwaCegarLoop]: 1408 mSDtfsCounter, 221 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:56,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 2595 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:36:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23490 states. [2024-10-14 03:36:57,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23490 to 23488. [2024-10-14 03:36:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23488 states, 23487 states have (on average 1.7769830118789118) internal successors, (41736), 23487 states have internal predecessors, (41736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23488 states to 23488 states and 41736 transitions. [2024-10-14 03:36:57,133 INFO L78 Accepts]: Start accepts. Automaton has 23488 states and 41736 transitions. Word has length 236 [2024-10-14 03:36:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:57,134 INFO L471 AbstractCegarLoop]: Abstraction has 23488 states and 41736 transitions. [2024-10-14 03:36:57,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 23488 states and 41736 transitions. [2024-10-14 03:36:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-14 03:36:57,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:57,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:57,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:36:57,139 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:57,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1908212328, now seen corresponding path program 1 times [2024-10-14 03:36:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:57,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971693675] [2024-10-14 03:36:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:57,384 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-14 03:36:57,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971693675] [2024-10-14 03:36:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971693675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:36:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336559535] [2024-10-14 03:36:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:57,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:36:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:57,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:36:57,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:36:57,390 INFO L87 Difference]: Start difference. First operand 23488 states and 41736 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:36:57,989 INFO L93 Difference]: Finished difference Result 45456 states and 80743 transitions. [2024-10-14 03:36:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:36:57,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-10-14 03:36:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:36:58,073 INFO L225 Difference]: With dead ends: 45456 [2024-10-14 03:36:58,073 INFO L226 Difference]: Without dead ends: 33158 [2024-10-14 03:36:58,101 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-14 03:36:58,101 INFO L432 NwaCegarLoop]: 1388 mSDtfsCounter, 213 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:36:58,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2576 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:36:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33158 states. [2024-10-14 03:36:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33158 to 33156. [2024-10-14 03:36:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33156 states, 33155 states have (on average 1.7695068617101493) internal successors, (58668), 33155 states have internal predecessors, (58668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33156 states to 33156 states and 58668 transitions. [2024-10-14 03:36:58,898 INFO L78 Accepts]: Start accepts. Automaton has 33156 states and 58668 transitions. Word has length 236 [2024-10-14 03:36:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:36:58,899 INFO L471 AbstractCegarLoop]: Abstraction has 33156 states and 58668 transitions. [2024-10-14 03:36:58,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:36:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 33156 states and 58668 transitions. [2024-10-14 03:36:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-14 03:36:58,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:36:58,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:36:58,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:36:58,904 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:36:58,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:36:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1532108728, now seen corresponding path program 1 times [2024-10-14 03:36:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:36:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531717106] [2024-10-14 03:36:58,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:36:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:36:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:36:59,267 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-14 03:36:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:36:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531717106] [2024-10-14 03:36:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531717106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:36:59,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:36:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:36:59,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405776387] [2024-10-14 03:36:59,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:36:59,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:36:59,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:36:59,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:36:59,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:36:59,272 INFO L87 Difference]: Start difference. First operand 33156 states and 58668 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:37:00,012 INFO L93 Difference]: Finished difference Result 64180 states and 113507 transitions. [2024-10-14 03:37:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:37:00,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-10-14 03:37:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:37:00,124 INFO L225 Difference]: With dead ends: 64180 [2024-10-14 03:37:00,125 INFO L226 Difference]: Without dead ends: 46694 [2024-10-14 03:37:00,162 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-14 03:37:00,164 INFO L432 NwaCegarLoop]: 1368 mSDtfsCounter, 205 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:37:00,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 2557 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:37:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46694 states. [2024-10-14 03:37:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46694 to 46692. [2024-10-14 03:37:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46692 states, 46691 states have (on average 1.7610674434045106) internal successors, (82226), 46691 states have internal predecessors, (82226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46692 states to 46692 states and 82226 transitions. [2024-10-14 03:37:01,219 INFO L78 Accepts]: Start accepts. Automaton has 46692 states and 82226 transitions. Word has length 236 [2024-10-14 03:37:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:37:01,220 INFO L471 AbstractCegarLoop]: Abstraction has 46692 states and 82226 transitions. [2024-10-14 03:37:01,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 46692 states and 82226 transitions. [2024-10-14 03:37:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-14 03:37:01,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:37:01,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:37:01,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:37:01,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:37:01,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:37:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1909104168, now seen corresponding path program 1 times [2024-10-14 03:37:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:37:01,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392241912] [2024-10-14 03:37:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:37:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:37:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:37:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:37:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:37:01,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392241912] [2024-10-14 03:37:01,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392241912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:37:01,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:37:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:37:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011346422] [2024-10-14 03:37:01,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:37:01,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:37:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:37:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:37:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:37:01,660 INFO L87 Difference]: Start difference. First operand 46692 states and 82226 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:37:02,650 INFO L93 Difference]: Finished difference Result 90340 states and 158983 transitions. [2024-10-14 03:37:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:37:02,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-10-14 03:37:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:37:02,974 INFO L225 Difference]: With dead ends: 90340 [2024-10-14 03:37:02,974 INFO L226 Difference]: Without dead ends: 65552 [2024-10-14 03:37:03,010 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-14 03:37:03,011 INFO L432 NwaCegarLoop]: 1348 mSDtfsCounter, 197 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:37:03,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 2538 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:37:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65552 states. [2024-10-14 03:37:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65552 to 65550. [2024-10-14 03:37:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65550 states, 65549 states have (on average 1.751483622938565) internal successors, (114808), 65549 states have internal predecessors, (114808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65550 states to 65550 states and 114808 transitions. [2024-10-14 03:37:04,617 INFO L78 Accepts]: Start accepts. Automaton has 65550 states and 114808 transitions. Word has length 236 [2024-10-14 03:37:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:37:04,618 INFO L471 AbstractCegarLoop]: Abstraction has 65550 states and 114808 transitions. [2024-10-14 03:37:04,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 65550 states and 114808 transitions. [2024-10-14 03:37:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-14 03:37:04,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:37:04,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:37:04,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:37:04,622 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:37:04,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:37:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1808335847, now seen corresponding path program 1 times [2024-10-14 03:37:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:37:04,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538125755] [2024-10-14 03:37:04,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:37:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:37:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:37:05,182 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-14 03:37:05,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:37:05,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538125755] [2024-10-14 03:37:05,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538125755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:37:05,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:37:05,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:37:05,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2887553] [2024-10-14 03:37:05,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:37:05,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:37:05,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:37:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:37:05,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:37:05,186 INFO L87 Difference]: Start difference. First operand 65550 states and 114808 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:37:06,949 INFO L93 Difference]: Finished difference Result 216841 states and 379871 transitions. [2024-10-14 03:37:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:37:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-10-14 03:37:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:37:07,481 INFO L225 Difference]: With dead ends: 216841 [2024-10-14 03:37:07,481 INFO L226 Difference]: Without dead ends: 151890 [2024-10-14 03:37:07,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:37:07,570 INFO L432 NwaCegarLoop]: 1213 mSDtfsCounter, 730 mSDsluCounter, 2618 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:37:07,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3831 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:37:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151890 states. [2024-10-14 03:37:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151890 to 108451. [2024-10-14 03:37:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108451 states, 108450 states have (on average 1.743891194098663) internal successors, (189125), 108450 states have internal predecessors, (189125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108451 states to 108451 states and 189125 transitions. [2024-10-14 03:37:09,944 INFO L78 Accepts]: Start accepts. Automaton has 108451 states and 189125 transitions. Word has length 236 [2024-10-14 03:37:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:37:09,945 INFO L471 AbstractCegarLoop]: Abstraction has 108451 states and 189125 transitions. [2024-10-14 03:37:09,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 108451 states and 189125 transitions. [2024-10-14 03:37:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-14 03:37:09,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:37:09,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:37:09,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:37:09,950 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:37:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:37:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 160997321, now seen corresponding path program 1 times [2024-10-14 03:37:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:37:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767238305] [2024-10-14 03:37:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:37:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:37:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:37:10,604 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-14 03:37:10,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:37:10,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767238305] [2024-10-14 03:37:10,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767238305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:37:10,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:37:10,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:37:10,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187600812] [2024-10-14 03:37:10,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:37:10,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:37:10,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:37:10,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:37:10,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:37:10,608 INFO L87 Difference]: Start difference. First operand 108451 states and 189125 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:37:12,685 INFO L93 Difference]: Finished difference Result 358831 states and 625901 transitions. [2024-10-14 03:37:12,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:37:12,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2024-10-14 03:37:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:37:13,263 INFO L225 Difference]: With dead ends: 358831 [2024-10-14 03:37:13,263 INFO L226 Difference]: Without dead ends: 250979 [2024-10-14 03:37:13,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:37:13,357 INFO L432 NwaCegarLoop]: 1209 mSDtfsCounter, 728 mSDsluCounter, 2620 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 3829 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:37:13,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 3829 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:37:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250979 states. [2024-10-14 03:37:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250979 to 179272. [2024-10-14 03:37:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179272 states, 179271 states have (on average 1.736309832599807) internal successors, (311270), 179271 states have internal predecessors, (311270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179272 states to 179272 states and 311270 transitions. [2024-10-14 03:37:17,667 INFO L78 Accepts]: Start accepts. Automaton has 179272 states and 311270 transitions. Word has length 237 [2024-10-14 03:37:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:37:17,668 INFO L471 AbstractCegarLoop]: Abstraction has 179272 states and 311270 transitions. [2024-10-14 03:37:17,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 179272 states and 311270 transitions. [2024-10-14 03:37:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-14 03:37:17,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:37:17,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:37:17,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:37:17,671 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:37:17,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:37:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash 638562320, now seen corresponding path program 1 times [2024-10-14 03:37:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:37:17,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672859360] [2024-10-14 03:37:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:37:17,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:37:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:37:17,922 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-14 03:37:17,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:37:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672859360] [2024-10-14 03:37:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672859360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:37:17,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:37:17,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:37:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619099865] [2024-10-14 03:37:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:37:17,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:37:17,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:37:17,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:37:17,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:37:17,925 INFO L87 Difference]: Start difference. First operand 179272 states and 311270 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:37:22,427 INFO L93 Difference]: Finished difference Result 591525 states and 1027347 transitions. [2024-10-14 03:37:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:37:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2024-10-14 03:37:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:37:23,763 INFO L225 Difference]: With dead ends: 591525 [2024-10-14 03:37:23,763 INFO L226 Difference]: Without dead ends: 412852 [2024-10-14 03:37:23,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:37:23,906 INFO L432 NwaCegarLoop]: 1209 mSDtfsCounter, 726 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:37:23,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 3831 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:37:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412852 states. [2024-10-14 03:37:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412852 to 295337. [2024-10-14 03:37:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295337 states, 295336 states have (on average 1.7288207329956389) internal successors, (510583), 295336 states have internal predecessors, (510583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295337 states to 295337 states and 510583 transitions. [2024-10-14 03:37:31,354 INFO L78 Accepts]: Start accepts. Automaton has 295337 states and 510583 transitions. Word has length 238 [2024-10-14 03:37:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:37:31,355 INFO L471 AbstractCegarLoop]: Abstraction has 295337 states and 510583 transitions. [2024-10-14 03:37:31,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 295337 states and 510583 transitions. [2024-10-14 03:37:31,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-14 03:37:31,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:37:31,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:37:31,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:37:31,357 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:37:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:37:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1731340142, now seen corresponding path program 1 times [2024-10-14 03:37:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:37:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755780321] [2024-10-14 03:37:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:37:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:37:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:37:31,600 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-14 03:37:31,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:37:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755780321] [2024-10-14 03:37:31,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755780321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:37:31,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:37:31,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:37:31,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986013051] [2024-10-14 03:37:31,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:37:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:37:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:37:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:37:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:37:31,602 INFO L87 Difference]: Start difference. First operand 295337 states and 510583 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:37:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:37:38,292 INFO L93 Difference]: Finished difference Result 967699 states and 1673593 transitions. [2024-10-14 03:37:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:37:38,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-10-14 03:37:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:37:39,773 INFO L225 Difference]: With dead ends: 967699 [2024-10-14 03:37:39,774 INFO L226 Difference]: Without dead ends: 672961