./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_floodmax.3.ufo.BOUNDED-6.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_floodmax.3.ufo.BOUNDED-6.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 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:28:01,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:28:01,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:28:01,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:28:01,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:28:01,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:28:01,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:28:01,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:28:01,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:28:01,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:28:01,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:28:01,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:28:01,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:28:01,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:28:01,806 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:28:01,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:28:01,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:28:01,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:28:01,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:28:01,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:28:01,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:28:01,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:28:01,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:28:01,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:28:01,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:28:01,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:28:01,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:28:01,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:28:01,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:28:01,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:28:01,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:28:01,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:28:01,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:28:01,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:28:01,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:28:01,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:28:01,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:28:01,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:28:01,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:28:01,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:28:01,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:28:01,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:28:01,812 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 -> 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1 [2024-10-14 03:28:02,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:28:02,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:28:02,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:28:02,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:28:02,034 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:28:02,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2024-10-14 03:28:03,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:28:03,416 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:28:03,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2024-10-14 03:28:03,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf002782/051f844412584921a2665fdd1f339884/FLAG752067aae [2024-10-14 03:28:03,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf002782/051f844412584921a2665fdd1f339884 [2024-10-14 03:28:03,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:28:03,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:28:03,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:28:03,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:28:03,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:28:03,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15cda580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03, skipping insertion in model container [2024-10-14 03:28:03,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:28:03,664 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_floodmax.3.ufo.BOUNDED-6.pals.c[12762,12775] [2024-10-14 03:28:03,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:28:03,682 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:28:03,741 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_floodmax.3.ufo.BOUNDED-6.pals.c[12762,12775] [2024-10-14 03:28:03,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:28:03,764 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:28:03,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03 WrapperNode [2024-10-14 03:28:03,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:28:03,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:28:03,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:28:03,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:28:03,773 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:28:03" (1/1) ... [2024-10-14 03:28:03,783 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:28:03" (1/1) ... [2024-10-14 03:28:03,824 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-10-14 03:28:03,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:28:03,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:28:03,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:28:03,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:28:03,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,869 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:28:03,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:28:03,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:28:03,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:28:03,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:28:03,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (1/1) ... [2024-10-14 03:28:03,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:28:03,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:28:03,934 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:28:03,937 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:28:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:28:03,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:28:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:28:03,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:28:04,060 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:28:04,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:28:04,490 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-14 03:28:04,490 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:28:04,555 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:28:04,556 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:28:04,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:28:04 BoogieIcfgContainer [2024-10-14 03:28:04,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:28:04,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:28:04,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:28:04,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:28:04,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:28:03" (1/3) ... [2024-10-14 03:28:04,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3117dbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:28:04, skipping insertion in model container [2024-10-14 03:28:04,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:28:03" (2/3) ... [2024-10-14 03:28:04,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3117dbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:28:04, skipping insertion in model container [2024-10-14 03:28:04,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:28:04" (3/3) ... [2024-10-14 03:28:04,563 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c [2024-10-14 03:28:04,605 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:28:04,606 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:28:04,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:28:04,666 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;@225ca563, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:28:04,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:28:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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:28:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:28:04,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:04,681 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] [2024-10-14 03:28:04,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:04,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1477667755, now seen corresponding path program 1 times [2024-10-14 03:28:04,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:04,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635074981] [2024-10-14 03:28:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:04,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:04,975 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:28:04,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:04,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635074981] [2024-10-14 03:28:04,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635074981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:04,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:28:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070375703] [2024-10-14 03:28:04,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:04,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:28:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:05,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:28:05,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:28:05,014 INFO L87 Difference]: Start difference. First operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 0 states have call successors, (0), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:28:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:05,049 INFO L93 Difference]: Finished difference Result 174 states and 308 transitions. [2024-10-14 03:28:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:28:05,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-14 03:28:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:05,060 INFO L225 Difference]: With dead ends: 174 [2024-10-14 03:28:05,060 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 03:28:05,062 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:28:05,064 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:05,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 03:28:05,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 03:28:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.7927927927927927) internal successors, (199), 111 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:28:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 199 transitions. [2024-10-14 03:28:05,096 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 199 transitions. Word has length 34 [2024-10-14 03:28:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:05,096 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 199 transitions. [2024-10-14 03:28:05,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:28:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 199 transitions. [2024-10-14 03:28:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:28:05,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:05,097 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] [2024-10-14 03:28:05,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:28:05,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:05,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:05,099 INFO L85 PathProgramCache]: Analyzing trace with hash -211275987, now seen corresponding path program 1 times [2024-10-14 03:28:05,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:05,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654984385] [2024-10-14 03:28:05,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:05,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:05,275 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:28:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654984385] [2024-10-14 03:28:05,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654984385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:05,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:05,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:28:05,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179943027] [2024-10-14 03:28:05,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:05,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:28:05,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:05,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:28:05,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:05,282 INFO L87 Difference]: Start difference. First operand 112 states and 199 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:28:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:05,400 INFO L93 Difference]: Finished difference Result 229 states and 400 transitions. [2024-10-14 03:28:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:28:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-14 03:28:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:05,405 INFO L225 Difference]: With dead ends: 229 [2024-10-14 03:28:05,405 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 03:28:05,406 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:28:05,406 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 98 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:05,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 552 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:28:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 03:28:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 112. [2024-10-14 03:28:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 111 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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:28:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 172 transitions. [2024-10-14 03:28:05,425 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 172 transitions. Word has length 34 [2024-10-14 03:28:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:05,426 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 172 transitions. [2024-10-14 03:28:05,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:28:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 172 transitions. [2024-10-14 03:28:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 03:28:05,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:05,428 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] [2024-10-14 03:28:05,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:28:05,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:05,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash -985754314, now seen corresponding path program 1 times [2024-10-14 03:28:05,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:05,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017717272] [2024-10-14 03:28:05,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:05,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:05,589 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:28:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:05,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017717272] [2024-10-14 03:28:05,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017717272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:05,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:05,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28999112] [2024-10-14 03:28:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:05,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:05,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:05,596 INFO L87 Difference]: Start difference. First operand 112 states and 172 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:28:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:05,651 INFO L93 Difference]: Finished difference Result 217 states and 353 transitions. [2024-10-14 03:28:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:05,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-14 03:28:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:05,655 INFO L225 Difference]: With dead ends: 217 [2024-10-14 03:28:05,655 INFO L226 Difference]: Without dead ends: 160 [2024-10-14 03:28:05,655 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:28:05,657 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 74 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:05,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 363 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-14 03:28:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2024-10-14 03:28:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5796178343949046) internal successors, (248), 157 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 248 transitions. [2024-10-14 03:28:05,668 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 248 transitions. Word has length 60 [2024-10-14 03:28:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:05,668 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 248 transitions. [2024-10-14 03:28:05,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:28:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 248 transitions. [2024-10-14 03:28:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 03:28:05,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:05,670 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] [2024-10-14 03:28:05,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:28:05,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:05,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1305875761, now seen corresponding path program 1 times [2024-10-14 03:28:05,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:05,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488087273] [2024-10-14 03:28:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:05,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:28:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488087273] [2024-10-14 03:28:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488087273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087405620] [2024-10-14 03:28:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:05,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:05,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:05,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:05,773 INFO L87 Difference]: Start difference. First operand 158 states and 248 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:28:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:05,803 INFO L93 Difference]: Finished difference Result 263 states and 429 transitions. [2024-10-14 03:28:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:05,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-14 03:28:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:05,805 INFO L225 Difference]: With dead ends: 263 [2024-10-14 03:28:05,805 INFO L226 Difference]: Without dead ends: 206 [2024-10-14 03:28:05,806 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:28:05,807 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 83 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 389 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:05,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 389 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-14 03:28:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-10-14 03:28:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 203 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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:28:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 327 transitions. [2024-10-14 03:28:05,817 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 327 transitions. Word has length 62 [2024-10-14 03:28:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:05,818 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 327 transitions. [2024-10-14 03:28:05,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:28:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 327 transitions. [2024-10-14 03:28:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 03:28:05,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:05,819 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] [2024-10-14 03:28:05,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:28:05,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:05,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1944934066, now seen corresponding path program 1 times [2024-10-14 03:28:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849287714] [2024-10-14 03:28:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:05,927 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:28:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:05,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849287714] [2024-10-14 03:28:05,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849287714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:05,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:05,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942850373] [2024-10-14 03:28:05,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:05,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:05,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:05,929 INFO L87 Difference]: Start difference. First operand 204 states and 327 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:28:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:05,949 INFO L93 Difference]: Finished difference Result 477 states and 792 transitions. [2024-10-14 03:28:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:05,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-14 03:28:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:05,951 INFO L225 Difference]: With dead ends: 477 [2024-10-14 03:28:05,951 INFO L226 Difference]: Without dead ends: 330 [2024-10-14 03:28:05,952 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:28:05,952 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 76 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:05,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 376 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-14 03:28:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2024-10-14 03:28:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.6391437308868502) internal successors, (536), 327 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 536 transitions. [2024-10-14 03:28:05,967 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 536 transitions. Word has length 62 [2024-10-14 03:28:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:05,967 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 536 transitions. [2024-10-14 03:28:05,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:28:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 536 transitions. [2024-10-14 03:28:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 03:28:05,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:05,968 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] [2024-10-14 03:28:05,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:28:05,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:05,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:05,973 INFO L85 PathProgramCache]: Analyzing trace with hash -386894903, now seen corresponding path program 1 times [2024-10-14 03:28:05,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:05,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248706739] [2024-10-14 03:28:05,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:05,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:06,067 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:28:06,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:06,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248706739] [2024-10-14 03:28:06,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248706739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:06,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:06,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144202866] [2024-10-14 03:28:06,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:06,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:06,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:06,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:06,069 INFO L87 Difference]: Start difference. First operand 328 states and 536 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:28:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:06,096 INFO L93 Difference]: Finished difference Result 595 states and 989 transitions. [2024-10-14 03:28:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-14 03:28:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:06,099 INFO L225 Difference]: With dead ends: 595 [2024-10-14 03:28:06,099 INFO L226 Difference]: Without dead ends: 448 [2024-10-14 03:28:06,099 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:28:06,103 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 77 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 381 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:06,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-14 03:28:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2024-10-14 03:28:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.644943820224719) internal successors, (732), 445 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:28:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 732 transitions. [2024-10-14 03:28:06,124 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 732 transitions. Word has length 64 [2024-10-14 03:28:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:06,125 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 732 transitions. [2024-10-14 03:28:06,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:28:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 732 transitions. [2024-10-14 03:28:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 03:28:06,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:06,131 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] [2024-10-14 03:28:06,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:28:06,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:06,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:06,131 INFO L85 PathProgramCache]: Analyzing trace with hash 892182118, now seen corresponding path program 1 times [2024-10-14 03:28:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:06,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396146123] [2024-10-14 03:28:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:06,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:06,237 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:28:06,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:06,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396146123] [2024-10-14 03:28:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396146123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:06,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:06,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:06,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478398396] [2024-10-14 03:28:06,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:06,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:06,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:06,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:06,240 INFO L87 Difference]: Start difference. First operand 446 states and 732 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:28:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:06,271 INFO L93 Difference]: Finished difference Result 1149 states and 1913 transitions. [2024-10-14 03:28:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:06,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-14 03:28:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:06,276 INFO L225 Difference]: With dead ends: 1149 [2024-10-14 03:28:06,276 INFO L226 Difference]: Without dead ends: 766 [2024-10-14 03:28:06,278 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:28:06,281 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 70 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:06,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 369 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-10-14 03:28:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 764. [2024-10-14 03:28:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 1.6435124508519003) internal successors, (1254), 763 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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:28:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1254 transitions. [2024-10-14 03:28:06,306 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1254 transitions. Word has length 64 [2024-10-14 03:28:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:06,307 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1254 transitions. [2024-10-14 03:28:06,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:28:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1254 transitions. [2024-10-14 03:28:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:28:06,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:06,310 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] [2024-10-14 03:28:06,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:28:06,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:06,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash 539603809, now seen corresponding path program 1 times [2024-10-14 03:28:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111416512] [2024-10-14 03:28:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:06,382 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:28:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:06,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111416512] [2024-10-14 03:28:06,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111416512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:06,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:06,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:06,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051098561] [2024-10-14 03:28:06,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:06,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:06,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:06,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:06,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:06,384 INFO L87 Difference]: Start difference. First operand 764 states and 1254 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:28:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:06,426 INFO L93 Difference]: Finished difference Result 1437 states and 2381 transitions. [2024-10-14 03:28:06,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:06,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-14 03:28:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:06,429 INFO L225 Difference]: With dead ends: 1437 [2024-10-14 03:28:06,429 INFO L226 Difference]: Without dead ends: 1054 [2024-10-14 03:28:06,430 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:28:06,431 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 71 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 373 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:06,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 373 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-10-14 03:28:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1052. [2024-10-14 03:28:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.637488106565176) internal successors, (1721), 1051 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states 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:28:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1721 transitions. [2024-10-14 03:28:06,454 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1721 transitions. Word has length 66 [2024-10-14 03:28:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:06,454 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1721 transitions. [2024-10-14 03:28:06,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:28:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1721 transitions. [2024-10-14 03:28:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:28:06,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:06,455 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] [2024-10-14 03:28:06,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:28:06,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:06,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:06,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1422478210, now seen corresponding path program 1 times [2024-10-14 03:28:06,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:06,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878936184] [2024-10-14 03:28:06,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:06,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:06,562 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:28:06,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:06,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878936184] [2024-10-14 03:28:06,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878936184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:06,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:06,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:28:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739528523] [2024-10-14 03:28:06,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:06,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:28:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:06,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:28:06,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:28:06,566 INFO L87 Difference]: Start difference. First operand 1052 states and 1721 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:28:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:06,748 INFO L93 Difference]: Finished difference Result 5336 states and 8927 transitions. [2024-10-14 03:28:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:28:06,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-14 03:28:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:06,762 INFO L225 Difference]: With dead ends: 5336 [2024-10-14 03:28:06,762 INFO L226 Difference]: Without dead ends: 4353 [2024-10-14 03:28:06,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:28:06,765 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 576 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:06,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1062 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:28:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4353 states. [2024-10-14 03:28:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4353 to 1969. [2024-10-14 03:28:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.6346544715447155) internal successors, (3217), 1968 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states 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:28:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 3217 transitions. [2024-10-14 03:28:06,816 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 3217 transitions. Word has length 66 [2024-10-14 03:28:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:06,816 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 3217 transitions. [2024-10-14 03:28:06,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:28:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 3217 transitions. [2024-10-14 03:28:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:28:06,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:06,817 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] [2024-10-14 03:28:06,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:28:06,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:06,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1209872637, now seen corresponding path program 1 times [2024-10-14 03:28:06,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:06,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153178571] [2024-10-14 03:28:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:06,905 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:28:06,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:06,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153178571] [2024-10-14 03:28:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153178571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:28:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673943322] [2024-10-14 03:28:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:06,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:28:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:28:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:06,907 INFO L87 Difference]: Start difference. First operand 1969 states and 3217 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:28:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:06,999 INFO L93 Difference]: Finished difference Result 6431 states and 10655 transitions. [2024-10-14 03:28:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:28:06,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-14 03:28:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:07,013 INFO L225 Difference]: With dead ends: 6431 [2024-10-14 03:28:07,015 INFO L226 Difference]: Without dead ends: 4531 [2024-10-14 03:28:07,018 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:28:07,018 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 280 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 542 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:07,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 542 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2024-10-14 03:28:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 3231. [2024-10-14 03:28:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3231 states, 3230 states have (on average 1.6368421052631579) internal successors, (5287), 3230 states have internal predecessors, (5287), 0 states have call successors, (0), 0 states 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:28:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 5287 transitions. [2024-10-14 03:28:07,090 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 5287 transitions. Word has length 67 [2024-10-14 03:28:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:07,090 INFO L471 AbstractCegarLoop]: Abstraction has 3231 states and 5287 transitions. [2024-10-14 03:28:07,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:28:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 5287 transitions. [2024-10-14 03:28:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 03:28:07,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:07,091 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] [2024-10-14 03:28:07,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:28:07,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:07,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:07,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1091384583, now seen corresponding path program 1 times [2024-10-14 03:28:07,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:07,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760079588] [2024-10-14 03:28:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:07,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:07,164 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:28:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760079588] [2024-10-14 03:28:07,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760079588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:07,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:07,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:28:07,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058089741] [2024-10-14 03:28:07,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:07,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:28:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:07,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:28:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:07,166 INFO L87 Difference]: Start difference. First operand 3231 states and 5287 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:28:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:07,308 INFO L93 Difference]: Finished difference Result 10391 states and 17091 transitions. [2024-10-14 03:28:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:28:07,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-14 03:28:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:07,326 INFO L225 Difference]: With dead ends: 10391 [2024-10-14 03:28:07,326 INFO L226 Difference]: Without dead ends: 7229 [2024-10-14 03:28:07,329 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:28:07,330 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 278 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 539 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:07,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 539 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2024-10-14 03:28:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 5201. [2024-10-14 03:28:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 5200 states have (on average 1.6259615384615385) internal successors, (8455), 5200 states have internal predecessors, (8455), 0 states have call successors, (0), 0 states 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:28:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 8455 transitions. [2024-10-14 03:28:07,456 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 8455 transitions. Word has length 68 [2024-10-14 03:28:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:07,456 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 8455 transitions. [2024-10-14 03:28:07,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:28:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 8455 transitions. [2024-10-14 03:28:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:28:07,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:07,457 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] [2024-10-14 03:28:07,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:28:07,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash -578633876, now seen corresponding path program 1 times [2024-10-14 03:28:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:07,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684703317] [2024-10-14 03:28:07,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:07,548 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:28:07,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:07,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684703317] [2024-10-14 03:28:07,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684703317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:07,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:07,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:28:07,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548176276] [2024-10-14 03:28:07,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:07,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:28:07,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:07,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:28:07,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:07,551 INFO L87 Difference]: Start difference. First operand 5201 states and 8455 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:28:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:07,738 INFO L93 Difference]: Finished difference Result 16423 states and 26807 transitions. [2024-10-14 03:28:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:28:07,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-14 03:28:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:07,766 INFO L225 Difference]: With dead ends: 16423 [2024-10-14 03:28:07,766 INFO L226 Difference]: Without dead ends: 11291 [2024-10-14 03:28:07,775 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:28:07,776 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 276 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 541 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:28:07,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 541 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:28:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2024-10-14 03:28:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 8203. [2024-10-14 03:28:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8203 states, 8202 states have (on average 1.6146061936113143) internal successors, (13243), 8202 states have internal predecessors, (13243), 0 states have call successors, (0), 0 states 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:28:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 13243 transitions. [2024-10-14 03:28:08,023 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 13243 transitions. Word has length 69 [2024-10-14 03:28:08,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:08,023 INFO L471 AbstractCegarLoop]: Abstraction has 8203 states and 13243 transitions. [2024-10-14 03:28:08,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:28:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 13243 transitions. [2024-10-14 03:28:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:28:08,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:08,026 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] [2024-10-14 03:28:08,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:28:08,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:08,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash 802275316, now seen corresponding path program 1 times [2024-10-14 03:28:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:08,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077819585] [2024-10-14 03:28:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:08,186 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:28:08,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:08,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077819585] [2024-10-14 03:28:08,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077819585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:08,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:08,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:28:08,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874536179] [2024-10-14 03:28:08,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:08,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:28:08,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:08,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:28:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:28:08,188 INFO L87 Difference]: Start difference. First operand 8203 states and 13243 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:28:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:08,392 INFO L93 Difference]: Finished difference Result 16339 states and 26396 transitions. [2024-10-14 03:28:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:28:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-14 03:28:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:08,404 INFO L225 Difference]: With dead ends: 16339 [2024-10-14 03:28:08,404 INFO L226 Difference]: Without dead ends: 8205 [2024-10-14 03:28:08,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:28:08,411 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 70 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:08,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 593 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8205 states. [2024-10-14 03:28:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8205 to 8203. [2024-10-14 03:28:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8203 states, 8202 states have (on average 1.599366008290661) internal successors, (13118), 8202 states have internal predecessors, (13118), 0 states have call successors, (0), 0 states 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:28:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 13118 transitions. [2024-10-14 03:28:08,549 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 13118 transitions. Word has length 71 [2024-10-14 03:28:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:08,549 INFO L471 AbstractCegarLoop]: Abstraction has 8203 states and 13118 transitions. [2024-10-14 03:28:08,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:28:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 13118 transitions. [2024-10-14 03:28:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:28:08,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:08,550 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] [2024-10-14 03:28:08,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:28:08,551 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:08,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:08,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1920185732, now seen corresponding path program 1 times [2024-10-14 03:28:08,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:08,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362278224] [2024-10-14 03:28:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:08,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:08,717 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:28:08,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:08,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362278224] [2024-10-14 03:28:08,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362278224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:08,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:08,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:28:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798236788] [2024-10-14 03:28:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:08,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:28:08,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:28:08,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:28:08,719 INFO L87 Difference]: Start difference. First operand 8203 states and 13118 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:08,943 INFO L93 Difference]: Finished difference Result 23501 states and 37734 transitions. [2024-10-14 03:28:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:28:08,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-14 03:28:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:08,966 INFO L225 Difference]: With dead ends: 23501 [2024-10-14 03:28:08,967 INFO L226 Difference]: Without dead ends: 15367 [2024-10-14 03:28:08,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:28:08,975 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 135 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:08,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 455 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2024-10-14 03:28:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 15365. [2024-10-14 03:28:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15365 states, 15364 states have (on average 1.582725852642541) internal successors, (24317), 15364 states have internal predecessors, (24317), 0 states have call successors, (0), 0 states 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:28:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 24317 transitions. [2024-10-14 03:28:09,321 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 24317 transitions. Word has length 74 [2024-10-14 03:28:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:09,322 INFO L471 AbstractCegarLoop]: Abstraction has 15365 states and 24317 transitions. [2024-10-14 03:28:09,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:28:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 24317 transitions. [2024-10-14 03:28:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:28:09,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:09,323 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] [2024-10-14 03:28:09,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:28:09,324 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:09,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash -618303701, now seen corresponding path program 1 times [2024-10-14 03:28:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:09,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599204421] [2024-10-14 03:28:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:09,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:28:09,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:09,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599204421] [2024-10-14 03:28:09,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599204421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:09,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:28:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014189606] [2024-10-14 03:28:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:09,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:28:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:09,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:28:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:28:09,525 INFO L87 Difference]: Start difference. First operand 15365 states and 24317 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:28:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:09,781 INFO L93 Difference]: Finished difference Result 16091 states and 25404 transitions. [2024-10-14 03:28:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:28:09,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-14 03:28:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:09,805 INFO L225 Difference]: With dead ends: 16091 [2024-10-14 03:28:09,805 INFO L226 Difference]: Without dead ends: 16089 [2024-10-14 03:28:09,807 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:28:09,807 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:09,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16089 states. [2024-10-14 03:28:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16089 to 16089. [2024-10-14 03:28:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16089 states, 16088 states have (on average 1.555942317255097) internal successors, (25032), 16088 states have internal predecessors, (25032), 0 states have call successors, (0), 0 states 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:28:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16089 states to 16089 states and 25032 transitions. [2024-10-14 03:28:10,055 INFO L78 Accepts]: Start accepts. Automaton has 16089 states and 25032 transitions. Word has length 75 [2024-10-14 03:28:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:10,055 INFO L471 AbstractCegarLoop]: Abstraction has 16089 states and 25032 transitions. [2024-10-14 03:28:10,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:28:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 16089 states and 25032 transitions. [2024-10-14 03:28:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:28:10,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:10,057 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:10,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:28:10,057 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:10,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2029578417, now seen corresponding path program 1 times [2024-10-14 03:28:10,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:10,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872159707] [2024-10-14 03:28:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:10,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:28:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872159707] [2024-10-14 03:28:10,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872159707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:10,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:10,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602778208] [2024-10-14 03:28:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:10,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:10,165 INFO L87 Difference]: Start difference. First operand 16089 states and 25032 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:28:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:10,423 INFO L93 Difference]: Finished difference Result 48009 states and 74629 transitions. [2024-10-14 03:28:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:10,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-14 03:28:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:10,479 INFO L225 Difference]: With dead ends: 48009 [2024-10-14 03:28:10,479 INFO L226 Difference]: Without dead ends: 31985 [2024-10-14 03:28:10,503 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:28:10,504 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:10,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 399 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31985 states. [2024-10-14 03:28:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31985 to 31983. [2024-10-14 03:28:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31983 states, 31982 states have (on average 1.5403039209555376) internal successors, (49262), 31982 states have internal predecessors, (49262), 0 states have call successors, (0), 0 states 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:28:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31983 states to 31983 states and 49262 transitions. [2024-10-14 03:28:11,169 INFO L78 Accepts]: Start accepts. Automaton has 31983 states and 49262 transitions. Word has length 99 [2024-10-14 03:28:11,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:11,169 INFO L471 AbstractCegarLoop]: Abstraction has 31983 states and 49262 transitions. [2024-10-14 03:28:11,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:28:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 31983 states and 49262 transitions. [2024-10-14 03:28:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:28:11,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:11,174 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:11,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:28:11,174 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:11,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1881455852, now seen corresponding path program 1 times [2024-10-14 03:28:11,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:11,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118009901] [2024-10-14 03:28:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:28:11,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:11,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118009901] [2024-10-14 03:28:11,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118009901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:11,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:11,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:11,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695022086] [2024-10-14 03:28:11,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:11,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:11,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:11,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:11,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:11,259 INFO L87 Difference]: Start difference. First operand 31983 states and 49262 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:28:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:12,084 INFO L93 Difference]: Finished difference Result 95477 states and 146924 transitions. [2024-10-14 03:28:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 99 [2024-10-14 03:28:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:12,177 INFO L225 Difference]: With dead ends: 95477 [2024-10-14 03:28:12,177 INFO L226 Difference]: Without dead ends: 63592 [2024-10-14 03:28:12,205 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:28:12,206 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 95 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:12,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 374 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63592 states. [2024-10-14 03:28:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63592 to 63590. [2024-10-14 03:28:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63590 states, 63589 states have (on average 1.524508955951501) internal successors, (96942), 63589 states have internal predecessors, (96942), 0 states have call successors, (0), 0 states 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:28:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63590 states to 63590 states and 96942 transitions. [2024-10-14 03:28:13,576 INFO L78 Accepts]: Start accepts. Automaton has 63590 states and 96942 transitions. Word has length 99 [2024-10-14 03:28:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:13,578 INFO L471 AbstractCegarLoop]: Abstraction has 63590 states and 96942 transitions. [2024-10-14 03:28:13,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:28:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 63590 states and 96942 transitions. [2024-10-14 03:28:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:28:13,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:13,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:13,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:28:13,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:13,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:13,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1491540327, now seen corresponding path program 1 times [2024-10-14 03:28:13,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:13,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95582039] [2024-10-14 03:28:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:13,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:28:13,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:13,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95582039] [2024-10-14 03:28:13,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95582039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:13,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:13,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:13,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351180342] [2024-10-14 03:28:13,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:13,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:13,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:13,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:13,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:13,657 INFO L87 Difference]: Start difference. First operand 63590 states and 96942 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:28:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:15,353 INFO L93 Difference]: Finished difference Result 189890 states and 289215 transitions. [2024-10-14 03:28:15,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:15,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 99 [2024-10-14 03:28:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:15,558 INFO L225 Difference]: With dead ends: 189890 [2024-10-14 03:28:15,558 INFO L226 Difference]: Without dead ends: 126472 [2024-10-14 03:28:15,602 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:28:15,602 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 109 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:15,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 389 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126472 states. [2024-10-14 03:28:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126472 to 126470. [2024-10-14 03:28:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126470 states, 126469 states have (on average 1.508598945196056) internal successors, (190791), 126469 states have internal predecessors, (190791), 0 states have call successors, (0), 0 states 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:28:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126470 states to 126470 states and 190791 transitions. [2024-10-14 03:28:18,156 INFO L78 Accepts]: Start accepts. Automaton has 126470 states and 190791 transitions. Word has length 99 [2024-10-14 03:28:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:18,156 INFO L471 AbstractCegarLoop]: Abstraction has 126470 states and 190791 transitions. [2024-10-14 03:28:18,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:28:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 126470 states and 190791 transitions. [2024-10-14 03:28:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:28:18,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:18,166 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:18,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:28:18,166 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:18,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash 782589003, now seen corresponding path program 1 times [2024-10-14 03:28:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:18,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730739578] [2024-10-14 03:28:18,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:18,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:28:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730739578] [2024-10-14 03:28:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730739578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:18,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:18,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:18,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087982250] [2024-10-14 03:28:18,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:18,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:18,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:18,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:18,230 INFO L87 Difference]: Start difference. First operand 126470 states and 190791 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:28:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:21,265 INFO L93 Difference]: Finished difference Result 377614 states and 569134 transitions. [2024-10-14 03:28:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:21,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-14 03:28:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:21,713 INFO L225 Difference]: With dead ends: 377614 [2024-10-14 03:28:21,713 INFO L226 Difference]: Without dead ends: 251544 [2024-10-14 03:28:21,799 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:28:21,799 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 129 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:21,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 405 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251544 states. [2024-10-14 03:28:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251544 to 251542. [2024-10-14 03:28:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251542 states, 251541 states have (on average 1.492559861016693) internal successors, (375440), 251541 states have internal predecessors, (375440), 0 states have call successors, (0), 0 states 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:28:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251542 states to 251542 states and 375440 transitions. [2024-10-14 03:28:27,289 INFO L78 Accepts]: Start accepts. Automaton has 251542 states and 375440 transitions. Word has length 99 [2024-10-14 03:28:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:27,289 INFO L471 AbstractCegarLoop]: Abstraction has 251542 states and 375440 transitions. [2024-10-14 03:28:27,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:28:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 251542 states and 375440 transitions. [2024-10-14 03:28:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:28:27,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:27,304 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:27,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:28:27,304 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:27,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:27,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1206235725, now seen corresponding path program 1 times [2024-10-14 03:28:27,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:27,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283047165] [2024-10-14 03:28:27,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:27,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:28:27,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283047165] [2024-10-14 03:28:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283047165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:27,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:27,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377832246] [2024-10-14 03:28:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:27,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:27,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:27,360 INFO L87 Difference]: Start difference. First operand 251542 states and 375440 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:28:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:30,963 INFO L93 Difference]: Finished difference Result 377990 states and 562842 transitions. [2024-10-14 03:28:30,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:30,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-14 03:28:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:31,497 INFO L225 Difference]: With dead ends: 377990 [2024-10-14 03:28:31,497 INFO L226 Difference]: Without dead ends: 251888 [2024-10-14 03:28:31,599 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:28:31,600 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 100 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:31,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251888 states. [2024-10-14 03:28:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251888 to 251886. [2024-10-14 03:28:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251886 states, 251885 states have (on average 1.4786589118049904) internal successors, (372452), 251885 states have internal predecessors, (372452), 0 states have call successors, (0), 0 states 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:28:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251886 states to 251886 states and 372452 transitions. [2024-10-14 03:28:37,315 INFO L78 Accepts]: Start accepts. Automaton has 251886 states and 372452 transitions. Word has length 99 [2024-10-14 03:28:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:28:37,316 INFO L471 AbstractCegarLoop]: Abstraction has 251886 states and 372452 transitions. [2024-10-14 03:28:37,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:28:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 251886 states and 372452 transitions. [2024-10-14 03:28:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:28:37,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:28:37,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:28:37,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:28:37,332 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:28:37,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:28:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash 195118475, now seen corresponding path program 1 times [2024-10-14 03:28:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:28:37,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302994985] [2024-10-14 03:28:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:28:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:28:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:28:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:28:37,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:28:37,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302994985] [2024-10-14 03:28:37,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302994985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:28:37,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:28:37,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:28:37,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975514956] [2024-10-14 03:28:37,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:28:37,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:28:37,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:28:37,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:28:37,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:28:37,397 INFO L87 Difference]: Start difference. First operand 251886 states and 372452 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:28:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:40,527 INFO L93 Difference]: Finished difference Result 378534 states and 558401 transitions. [2024-10-14 03:28:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:28:40,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-14 03:28:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:41,027 INFO L225 Difference]: With dead ends: 378534 [2024-10-14 03:28:41,028 INFO L226 Difference]: Without dead ends: 252464 [2024-10-14 03:28:41,145 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:28:41,146 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 114 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:41,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 452 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:28:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252464 states.