./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d7ba9bef9a338f3463d946053d41baba5b0d351a2820fb2d5a03dd7d7748229 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:52:59,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:52:59,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:52:59,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:52:59,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:52:59,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:52:59,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:52:59,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:52:59,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:52:59,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:52:59,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:52:59,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:52:59,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:52:59,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:52:59,625 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:52:59,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:52:59,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:52:59,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:52:59,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:52:59,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:52:59,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:52:59,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:52:59,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:52:59,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:52:59,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:52:59,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:52:59,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:52:59,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:52:59,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:52:59,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:52:59,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:52:59,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:52:59,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:52:59,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:52:59,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:52:59,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:52:59,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:52:59,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:52:59,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:52:59,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:52:59,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:52:59,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:52:59,638 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d7ba9bef9a338f3463d946053d41baba5b0d351a2820fb2d5a03dd7d7748229 [2024-10-11 04:52:59,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:52:59,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:52:59,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:52:59,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:52:59,958 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:52:59,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-10-11 04:53:01,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:53:01,957 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:53:01,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-10-11 04:53:01,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/75a4967d2/e39c97df2dd143209f5e123d523ac23f/FLAG5b5200d97 [2024-10-11 04:53:02,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/75a4967d2/e39c97df2dd143209f5e123d523ac23f [2024-10-11 04:53:02,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:53:02,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:53:02,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:53:02,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:53:02,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:53:02,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:53:02" (1/1) ... [2024-10-11 04:53:02,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e360ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:02, skipping insertion in model container [2024-10-11 04:53:02,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:53:02" (1/1) ... [2024-10-11 04:53:02,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:53:02,535 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c[15510,15523] [2024-10-11 04:53:02,601 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c[22800,22813] [2024-10-11 04:53:03,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:53:03,357 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:53:03,404 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c[15510,15523] [2024-10-11 04:53:03,421 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c[22800,22813] [2024-10-11 04:53:03,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:53:03,839 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:53:03,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03 WrapperNode [2024-10-11 04:53:03,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:53:03,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:53:03,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:53:03,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:53:03,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:03,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,331 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5157 [2024-10-11 04:53:04,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:53:04,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:53:04,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:53:04,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:53:04,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,603 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-11 04:53:04,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:53:04,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:53:04,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:53:04,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:53:04,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (1/1) ... [2024-10-11 04:53:04,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:53:05,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:53:05,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:53:05,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:53:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:53:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:53:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:53:05,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:53:05,243 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:53:05,247 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:53:09,784 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2024-10-11 04:53:09,784 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:53:09,867 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:53:09,868 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:53:09,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:53:09 BoogieIcfgContainer [2024-10-11 04:53:09,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:53:09,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:53:09,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:53:09,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:53:09,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:53:02" (1/3) ... [2024-10-11 04:53:09,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b58d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:53:09, skipping insertion in model container [2024-10-11 04:53:09,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:03" (2/3) ... [2024-10-11 04:53:09,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b58d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:53:09, skipping insertion in model container [2024-10-11 04:53:09,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:53:09" (3/3) ... [2024-10-11 04:53:09,879 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-10-11 04:53:09,896 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:53:09,897 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:53:09,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:53:10,000 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;@17165315, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:53:10,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:53:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 851 states, 848 states have (on average 1.9728773584905661) internal successors, (1673), 850 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 04:53:10,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:10,019 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] [2024-10-11 04:53:10,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:10,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash -150308239, now seen corresponding path program 1 times [2024-10-11 04:53:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:10,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065512284] [2024-10-11 04:53:10,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:10,333 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-11 04:53:10,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:10,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065512284] [2024-10-11 04:53:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065512284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:53:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465923960] [2024-10-11 04:53:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:10,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:53:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:10,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:53:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:53:10,372 INFO L87 Difference]: Start difference. First operand has 851 states, 848 states have (on average 1.9728773584905661) internal successors, (1673), 850 states have internal predecessors, (1673), 0 states have call successors, (0), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:10,476 INFO L93 Difference]: Finished difference Result 1657 states and 3259 transitions. [2024-10-11 04:53:10,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:53:10,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-11 04:53:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:10,508 INFO L225 Difference]: With dead ends: 1657 [2024-10-11 04:53:10,509 INFO L226 Difference]: Without dead ends: 847 [2024-10-11 04:53:10,517 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-11 04:53:10,520 INFO L432 NwaCegarLoop]: 1601 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, 1601 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-11 04:53:10,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1601 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-11 04:53:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2024-10-11 04:53:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8958579881656805) internal successors, (1602), 846 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1602 transitions. [2024-10-11 04:53:10,611 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1602 transitions. Word has length 23 [2024-10-11 04:53:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:10,611 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1602 transitions. [2024-10-11 04:53:10,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1602 transitions. [2024-10-11 04:53:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 04:53:10,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:10,615 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] [2024-10-11 04:53:10,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:53:10,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:10,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1839251981, now seen corresponding path program 1 times [2024-10-11 04:53:10,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:10,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651891019] [2024-10-11 04:53:10,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:10,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:10,825 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-11 04:53:10,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:10,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651891019] [2024-10-11 04:53:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651891019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:10,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:10,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:53:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325062431] [2024-10-11 04:53:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:10,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:53:10,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:53:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:53:10,830 INFO L87 Difference]: Start difference. First operand 847 states and 1602 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:10,951 INFO L93 Difference]: Finished difference Result 899 states and 1684 transitions. [2024-10-11 04:53:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:53:10,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-11 04:53:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:10,955 INFO L225 Difference]: With dead ends: 899 [2024-10-11 04:53:10,956 INFO L226 Difference]: Without dead ends: 847 [2024-10-11 04:53:10,957 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-11 04:53:10,958 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:10,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4753 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-11 04:53:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2024-10-11 04:53:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8485207100591716) internal successors, (1562), 846 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1562 transitions. [2024-10-11 04:53:10,980 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1562 transitions. Word has length 23 [2024-10-11 04:53:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:10,980 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1562 transitions. [2024-10-11 04:53:10,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1562 transitions. [2024-10-11 04:53:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 04:53:10,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:10,984 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-11 04:53:10,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:53:10,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:10,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:10,985 INFO L85 PathProgramCache]: Analyzing trace with hash -138572409, now seen corresponding path program 1 times [2024-10-11 04:53:10,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:10,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447184637] [2024-10-11 04:53:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:11,381 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-11 04:53:11,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:11,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447184637] [2024-10-11 04:53:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447184637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:11,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:11,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238846378] [2024-10-11 04:53:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:11,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:11,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:11,385 INFO L87 Difference]: Start difference. First operand 847 states and 1562 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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-11 04:53:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:11,770 INFO L93 Difference]: Finished difference Result 1435 states and 2510 transitions. [2024-10-11 04:53:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:53:11,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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-11 04:53:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:11,778 INFO L225 Difference]: With dead ends: 1435 [2024-10-11 04:53:11,780 INFO L226 Difference]: Without dead ends: 1386 [2024-10-11 04:53:11,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:53:11,784 INFO L432 NwaCegarLoop]: 1553 mSDtfsCounter, 9829 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9829 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:11,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9829 Valid, 3039 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:53:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-10-11 04:53:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 894. [2024-10-11 04:53:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 892 states have (on average 1.836322869955157) internal successors, (1638), 893 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1638 transitions. [2024-10-11 04:53:11,818 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1638 transitions. Word has length 62 [2024-10-11 04:53:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:11,823 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1638 transitions. [2024-10-11 04:53:11,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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-11 04:53:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1638 transitions. [2024-10-11 04:53:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 04:53:11,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:11,825 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-11 04:53:11,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:53:11,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:11,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1430144389, now seen corresponding path program 1 times [2024-10-11 04:53:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39668319] [2024-10-11 04:53:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:11,993 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-11 04:53:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39668319] [2024-10-11 04:53:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39668319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:11,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:11,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:11,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599902481] [2024-10-11 04:53:11,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:11,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:53:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:53:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:53:11,996 INFO L87 Difference]: Start difference. First operand 894 states and 1638 transitions. Second operand has 4 states, 4 states have (on average 15.5) 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-11 04:53:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:17,810 INFO L93 Difference]: Finished difference Result 3149 states and 5947 transitions. [2024-10-11 04:53:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:53:17,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) 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-11 04:53:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:17,821 INFO L225 Difference]: With dead ends: 3149 [2024-10-11 04:53:17,822 INFO L226 Difference]: Without dead ends: 2396 [2024-10-11 04:53:17,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:53:17,825 INFO L432 NwaCegarLoop]: 813 mSDtfsCounter, 2440 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5157 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2440 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 6402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:17,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2440 Valid, 831 Invalid, 6402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5157 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-11 04:53:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-11 04:53:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2396. [2024-10-11 04:53:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2394 states have (on average 1.509607351712615) internal successors, (3614), 2395 states have internal predecessors, (3614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3614 transitions. [2024-10-11 04:53:17,883 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3614 transitions. Word has length 62 [2024-10-11 04:53:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:17,884 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3614 transitions. [2024-10-11 04:53:17,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) 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-11 04:53:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3614 transitions. [2024-10-11 04:53:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 04:53:17,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:17,886 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-11 04:53:17,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:53:17,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:17,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:17,887 INFO L85 PathProgramCache]: Analyzing trace with hash -157852617, now seen corresponding path program 1 times [2024-10-11 04:53:17,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:17,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028121874] [2024-10-11 04:53:17,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:17,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:18,025 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-11 04:53:18,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:18,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028121874] [2024-10-11 04:53:18,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028121874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:18,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:18,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:18,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458829686] [2024-10-11 04:53:18,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:18,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:18,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:18,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:18,029 INFO L87 Difference]: Start difference. First operand 2396 states and 3614 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-11 04:53:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:18,074 INFO L93 Difference]: Finished difference Result 2577 states and 3905 transitions. [2024-10-11 04:53:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:18,074 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-11 04:53:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:18,084 INFO L225 Difference]: With dead ends: 2577 [2024-10-11 04:53:18,084 INFO L226 Difference]: Without dead ends: 2481 [2024-10-11 04:53:18,087 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-11 04:53:18,088 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 1490 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:18,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1626 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2024-10-11 04:53:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2477. [2024-10-11 04:53:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.5119191919191919) internal successors, (3742), 2476 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3742 transitions. [2024-10-11 04:53:18,140 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3742 transitions. Word has length 64 [2024-10-11 04:53:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:18,140 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3742 transitions. [2024-10-11 04:53:18,141 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-11 04:53:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3742 transitions. [2024-10-11 04:53:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 04:53:18,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:18,142 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-11 04:53:18,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:53:18,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:18,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash -155707665, now seen corresponding path program 1 times [2024-10-11 04:53:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:18,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823445561] [2024-10-11 04:53:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:18,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:18,602 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-11 04:53:18,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823445561] [2024-10-11 04:53:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823445561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:18,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:18,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034126161] [2024-10-11 04:53:18,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:18,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:18,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:18,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:18,607 INFO L87 Difference]: Start difference. First operand 2477 states and 3742 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-11 04:53:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:18,866 INFO L93 Difference]: Finished difference Result 2656 states and 4026 transitions. [2024-10-11 04:53:18,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-11 04:53:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:18,878 INFO L225 Difference]: With dead ends: 2656 [2024-10-11 04:53:18,878 INFO L226 Difference]: Without dead ends: 2479 [2024-10-11 04:53:18,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:53:18,880 INFO L432 NwaCegarLoop]: 1551 mSDtfsCounter, 4519 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4519 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:18,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4519 Valid, 1930 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2024-10-11 04:53:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2477. [2024-10-11 04:53:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.511111111111111) internal successors, (3740), 2476 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3740 transitions. [2024-10-11 04:53:18,936 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3740 transitions. Word has length 64 [2024-10-11 04:53:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:18,936 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3740 transitions. [2024-10-11 04:53:18,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-11 04:53:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3740 transitions. [2024-10-11 04:53:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 04:53:18,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:18,940 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] [2024-10-11 04:53:18,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:53:18,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:18,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash -660670881, now seen corresponding path program 1 times [2024-10-11 04:53:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889344077] [2024-10-11 04:53:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:19,097 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-11 04:53:19,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:19,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889344077] [2024-10-11 04:53:19,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889344077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:19,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:19,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:53:19,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074461919] [2024-10-11 04:53:19,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:19,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:53:19,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:19,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:53:19,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:53:19,099 INFO L87 Difference]: Start difference. First operand 2477 states and 3740 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:19,135 INFO L93 Difference]: Finished difference Result 2483 states and 3747 transitions. [2024-10-11 04:53:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:53:19,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-11 04:53:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:19,145 INFO L225 Difference]: With dead ends: 2483 [2024-10-11 04:53:19,145 INFO L226 Difference]: Without dead ends: 2481 [2024-10-11 04:53:19,148 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-11 04:53:19,149 INFO L432 NwaCegarLoop]: 1558 mSDtfsCounter, 0 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4666 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:19,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4666 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2024-10-11 04:53:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2481. [2024-10-11 04:53:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2479 states have (on average 1.5098830173457038) internal successors, (3743), 2480 states have internal predecessors, (3743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3743 transitions. [2024-10-11 04:53:19,200 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3743 transitions. Word has length 65 [2024-10-11 04:53:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:19,200 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3743 transitions. [2024-10-11 04:53:19,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3743 transitions. [2024-10-11 04:53:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:19,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:19,203 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-11 04:53:19,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:53:19,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:19,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash -347651057, now seen corresponding path program 1 times [2024-10-11 04:53:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:19,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384923667] [2024-10-11 04:53:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:19,294 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-11 04:53:19,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:19,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384923667] [2024-10-11 04:53:19,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384923667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:19,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:19,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:19,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749511076] [2024-10-11 04:53:19,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:19,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:19,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:19,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:19,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:19,297 INFO L87 Difference]: Start difference. First operand 2481 states and 3743 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-11 04:53:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:19,333 INFO L93 Difference]: Finished difference Result 2827 states and 4283 transitions. [2024-10-11 04:53:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:19,333 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-11 04:53:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:19,342 INFO L225 Difference]: With dead ends: 2827 [2024-10-11 04:53:19,343 INFO L226 Difference]: Without dead ends: 2646 [2024-10-11 04:53:19,344 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-11 04:53:19,346 INFO L432 NwaCegarLoop]: 1604 mSDtfsCounter, 1503 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1691 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-11 04:53:19,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1691 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2024-10-11 04:53:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2644. [2024-10-11 04:53:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2642 states have (on average 1.5117335352006056) internal successors, (3994), 2643 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3994 transitions. [2024-10-11 04:53:19,396 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3994 transitions. Word has length 66 [2024-10-11 04:53:19,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:19,396 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3994 transitions. [2024-10-11 04:53:19,396 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-11 04:53:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3994 transitions. [2024-10-11 04:53:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:19,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:19,397 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-11 04:53:19,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:53:19,398 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:19,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:19,399 INFO L85 PathProgramCache]: Analyzing trace with hash -307707121, now seen corresponding path program 1 times [2024-10-11 04:53:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:19,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424220447] [2024-10-11 04:53:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:19,460 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-11 04:53:19,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424220447] [2024-10-11 04:53:19,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424220447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:19,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:19,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876284020] [2024-10-11 04:53:19,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:19,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:19,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:19,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:19,463 INFO L87 Difference]: Start difference. First operand 2644 states and 3994 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-11 04:53:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:19,503 INFO L93 Difference]: Finished difference Result 3300 states and 5008 transitions. [2024-10-11 04:53:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:19,504 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-11 04:53:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:19,513 INFO L225 Difference]: With dead ends: 3300 [2024-10-11 04:53:19,513 INFO L226 Difference]: Without dead ends: 2956 [2024-10-11 04:53:19,515 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-11 04:53:19,515 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 1501 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1693 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-11 04:53:19,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2024-10-11 04:53:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2954. [2024-10-11 04:53:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2952 states have (on average 1.5121951219512195) internal successors, (4464), 2953 states have internal predecessors, (4464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 4464 transitions. [2024-10-11 04:53:19,574 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 4464 transitions. Word has length 66 [2024-10-11 04:53:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:19,574 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 4464 transitions. [2024-10-11 04:53:19,574 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-11 04:53:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4464 transitions. [2024-10-11 04:53:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:19,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:19,575 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-11 04:53:19,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:53:19,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:19,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash -933363185, now seen corresponding path program 1 times [2024-10-11 04:53:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:19,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724489512] [2024-10-11 04:53:19,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:19,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:19,630 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-11 04:53:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724489512] [2024-10-11 04:53:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724489512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693461815] [2024-10-11 04:53:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:19,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:19,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:19,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:19,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:19,633 INFO L87 Difference]: Start difference. First operand 2954 states and 4464 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-11 04:53:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:19,679 INFO L93 Difference]: Finished difference Result 4198 states and 6362 transitions. [2024-10-11 04:53:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:19,680 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-11 04:53:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:19,692 INFO L225 Difference]: With dead ends: 4198 [2024-10-11 04:53:19,693 INFO L226 Difference]: Without dead ends: 3544 [2024-10-11 04:53:19,695 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-11 04:53:19,696 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 1499 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1695 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-11 04:53:19,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1695 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2024-10-11 04:53:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3542. [2024-10-11 04:53:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 3540 states have (on average 1.5084745762711864) internal successors, (5340), 3541 states have internal predecessors, (5340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 5340 transitions. [2024-10-11 04:53:19,768 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 5340 transitions. Word has length 66 [2024-10-11 04:53:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:19,769 INFO L471 AbstractCegarLoop]: Abstraction has 3542 states and 5340 transitions. [2024-10-11 04:53:19,769 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-11 04:53:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 5340 transitions. [2024-10-11 04:53:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:19,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:19,770 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-11 04:53:19,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:53:19,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash -44629745, now seen corresponding path program 1 times [2024-10-11 04:53:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008991451] [2024-10-11 04:53:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:19,822 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-11 04:53:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008991451] [2024-10-11 04:53:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008991451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:19,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:19,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605015828] [2024-10-11 04:53:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:19,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:19,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:19,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:19,825 INFO L87 Difference]: Start difference. First operand 3542 states and 5340 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-11 04:53:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:19,889 INFO L93 Difference]: Finished difference Result 5898 states and 8878 transitions. [2024-10-11 04:53:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:19,890 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-11 04:53:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:19,910 INFO L225 Difference]: With dead ends: 5898 [2024-10-11 04:53:19,913 INFO L226 Difference]: Without dead ends: 4656 [2024-10-11 04:53:19,918 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-11 04:53:19,920 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 1497 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1697 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-11 04:53:19,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1697 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4656 states. [2024-10-11 04:53:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4656 to 4654. [2024-10-11 04:53:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4654 states, 4652 states have (on average 1.4969905417024936) internal successors, (6964), 4653 states have internal predecessors, (6964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 6964 transitions. [2024-10-11 04:53:20,034 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 6964 transitions. Word has length 66 [2024-10-11 04:53:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:20,034 INFO L471 AbstractCegarLoop]: Abstraction has 4654 states and 6964 transitions. [2024-10-11 04:53:20,035 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-11 04:53:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 6964 transitions. [2024-10-11 04:53:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:20,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:20,036 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-11 04:53:20,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:53:20,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:20,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash -79067889, now seen corresponding path program 1 times [2024-10-11 04:53:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697158056] [2024-10-11 04:53:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:20,086 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-11 04:53:20,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:20,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697158056] [2024-10-11 04:53:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697158056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:20,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:20,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:20,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177216552] [2024-10-11 04:53:20,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:20,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:20,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:20,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:20,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:20,088 INFO L87 Difference]: Start difference. First operand 4654 states and 6964 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-11 04:53:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:20,236 INFO L93 Difference]: Finished difference Result 9106 states and 13526 transitions. [2024-10-11 04:53:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:20,237 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-11 04:53:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:20,261 INFO L225 Difference]: With dead ends: 9106 [2024-10-11 04:53:20,261 INFO L226 Difference]: Without dead ends: 6752 [2024-10-11 04:53:20,267 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-11 04:53:20,268 INFO L432 NwaCegarLoop]: 1614 mSDtfsCounter, 1505 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1697 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-11 04:53:20,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1697 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2024-10-11 04:53:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6750. [2024-10-11 04:53:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6750 states, 6748 states have (on average 1.4754001185536456) internal successors, (9956), 6749 states have internal predecessors, (9956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6750 states to 6750 states and 9956 transitions. [2024-10-11 04:53:20,453 INFO L78 Accepts]: Start accepts. Automaton has 6750 states and 9956 transitions. Word has length 66 [2024-10-11 04:53:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:20,454 INFO L471 AbstractCegarLoop]: Abstraction has 6750 states and 9956 transitions. [2024-10-11 04:53:20,457 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-11 04:53:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6750 states and 9956 transitions. [2024-10-11 04:53:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 04:53:20,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:20,458 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-11 04:53:20,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:53:20,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:20,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1522612916, now seen corresponding path program 1 times [2024-10-11 04:53:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:20,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227507318] [2024-10-11 04:53:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:20,520 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-11 04:53:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227507318] [2024-10-11 04:53:20,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227507318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:20,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:20,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810717567] [2024-10-11 04:53:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:20,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:20,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:20,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:20,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:20,524 INFO L87 Difference]: Start difference. First operand 6750 states and 9956 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-11 04:53:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:20,657 INFO L93 Difference]: Finished difference Result 11365 states and 16810 transitions. [2024-10-11 04:53:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:20,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-11 04:53:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:20,675 INFO L225 Difference]: With dead ends: 11365 [2024-10-11 04:53:20,676 INFO L226 Difference]: Without dead ends: 8866 [2024-10-11 04:53:20,682 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-11 04:53:20,684 INFO L432 NwaCegarLoop]: 1619 mSDtfsCounter, 1504 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1698 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-11 04:53:20,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1698 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2024-10-11 04:53:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8864. [2024-10-11 04:53:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8864 states, 8862 states have (on average 1.4667118032046942) internal successors, (12998), 8863 states have internal predecessors, (12998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8864 states to 8864 states and 12998 transitions. [2024-10-11 04:53:20,894 INFO L78 Accepts]: Start accepts. Automaton has 8864 states and 12998 transitions. Word has length 68 [2024-10-11 04:53:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:20,895 INFO L471 AbstractCegarLoop]: Abstraction has 8864 states and 12998 transitions. [2024-10-11 04:53:20,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-11 04:53:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8864 states and 12998 transitions. [2024-10-11 04:53:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:20,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:20,898 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] [2024-10-11 04:53:20,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:53:20,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:20,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:20,899 INFO L85 PathProgramCache]: Analyzing trace with hash 443992391, now seen corresponding path program 1 times [2024-10-11 04:53:20,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:20,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957962469] [2024-10-11 04:53:20,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:20,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:53:21,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:21,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957962469] [2024-10-11 04:53:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957962469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:21,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:21,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116386818] [2024-10-11 04:53:21,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:21,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:21,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:21,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:21,083 INFO L87 Difference]: Start difference. First operand 8864 states and 12998 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:21,984 INFO L93 Difference]: Finished difference Result 49582 states and 72109 transitions. [2024-10-11 04:53:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:21,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 86 [2024-10-11 04:53:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:22,080 INFO L225 Difference]: With dead ends: 49582 [2024-10-11 04:53:22,081 INFO L226 Difference]: Without dead ends: 43020 [2024-10-11 04:53:22,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:22,108 INFO L432 NwaCegarLoop]: 1634 mSDtfsCounter, 8086 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8086 SdHoareTripleChecker+Valid, 3866 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:22,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8086 Valid, 3866 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43020 states. [2024-10-11 04:53:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43020 to 15424. [2024-10-11 04:53:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15424 states, 15422 states have (on average 1.454934509142783) internal successors, (22438), 15423 states have internal predecessors, (22438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15424 states to 15424 states and 22438 transitions. [2024-10-11 04:53:22,920 INFO L78 Accepts]: Start accepts. Automaton has 15424 states and 22438 transitions. Word has length 86 [2024-10-11 04:53:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:22,920 INFO L471 AbstractCegarLoop]: Abstraction has 15424 states and 22438 transitions. [2024-10-11 04:53:22,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15424 states and 22438 transitions. [2024-10-11 04:53:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:22,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:22,924 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] [2024-10-11 04:53:22,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:53:22,925 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash 483936327, now seen corresponding path program 1 times [2024-10-11 04:53:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729646230] [2024-10-11 04:53:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:53:23,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:23,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729646230] [2024-10-11 04:53:23,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729646230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:23,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:23,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725146433] [2024-10-11 04:53:23,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:23,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:23,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:23,157 INFO L87 Difference]: Start difference. First operand 15424 states and 22438 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:24,361 INFO L93 Difference]: Finished difference Result 56142 states and 81549 transitions. [2024-10-11 04:53:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:24,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:53:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:24,491 INFO L225 Difference]: With dead ends: 56142 [2024-10-11 04:53:24,491 INFO L226 Difference]: Without dead ends: 49580 [2024-10-11 04:53:24,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:24,513 INFO L432 NwaCegarLoop]: 1631 mSDtfsCounter, 8138 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8138 SdHoareTripleChecker+Valid, 3766 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:24,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8138 Valid, 3766 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49580 states. [2024-10-11 04:53:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49580 to 25280. [2024-10-11 04:53:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25280 states, 25278 states have (on average 1.4446554316006013) internal successors, (36518), 25279 states have internal predecessors, (36518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25280 states to 25280 states and 36518 transitions. [2024-10-11 04:53:25,425 INFO L78 Accepts]: Start accepts. Automaton has 25280 states and 36518 transitions. Word has length 86 [2024-10-11 04:53:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:25,425 INFO L471 AbstractCegarLoop]: Abstraction has 25280 states and 36518 transitions. [2024-10-11 04:53:25,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 25280 states and 36518 transitions. [2024-10-11 04:53:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:25,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:25,429 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] [2024-10-11 04:53:25,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:53:25,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:25,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash -141719737, now seen corresponding path program 1 times [2024-10-11 04:53:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:25,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055714684] [2024-10-11 04:53:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:25,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:53:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055714684] [2024-10-11 04:53:25,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055714684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:25,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:25,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:25,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903010859] [2024-10-11 04:53:25,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:25,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:25,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:25,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:25,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:25,635 INFO L87 Difference]: Start difference. First operand 25280 states and 36518 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:26,674 INFO L93 Difference]: Finished difference Result 62702 states and 90989 transitions. [2024-10-11 04:53:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:26,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:53:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:26,769 INFO L225 Difference]: With dead ends: 62702 [2024-10-11 04:53:26,769 INFO L226 Difference]: Without dead ends: 56140 [2024-10-11 04:53:26,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:26,794 INFO L432 NwaCegarLoop]: 1628 mSDtfsCounter, 8187 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8187 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:26,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8187 Valid, 3768 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56140 states. [2024-10-11 04:53:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56140 to 31840. [2024-10-11 04:53:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31840 states, 31838 states have (on average 1.4434951944217602) internal successors, (45958), 31839 states have internal predecessors, (45958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31840 states to 31840 states and 45958 transitions. [2024-10-11 04:53:28,108 INFO L78 Accepts]: Start accepts. Automaton has 31840 states and 45958 transitions. Word has length 86 [2024-10-11 04:53:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:28,108 INFO L471 AbstractCegarLoop]: Abstraction has 31840 states and 45958 transitions. [2024-10-11 04:53:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 31840 states and 45958 transitions. [2024-10-11 04:53:28,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:28,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:28,112 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] [2024-10-11 04:53:28,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:53:28,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash 747013703, now seen corresponding path program 1 times [2024-10-11 04:53:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631393718] [2024-10-11 04:53:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 04:53:28,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:28,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631393718] [2024-10-11 04:53:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631393718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:28,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:28,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670032766] [2024-10-11 04:53:28,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:28,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:28,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:28,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:28,344 INFO L87 Difference]: Start difference. First operand 31840 states and 45958 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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-11 04:53:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:29,909 INFO L93 Difference]: Finished difference Result 69262 states and 100429 transitions. [2024-10-11 04:53:29,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:29,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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 86 [2024-10-11 04:53:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:29,997 INFO L225 Difference]: With dead ends: 69262 [2024-10-11 04:53:29,997 INFO L226 Difference]: Without dead ends: 62700 [2024-10-11 04:53:30,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:30,021 INFO L432 NwaCegarLoop]: 1633 mSDtfsCounter, 8094 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8094 SdHoareTripleChecker+Valid, 3853 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:30,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8094 Valid, 3853 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62700 states. [2024-10-11 04:53:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62700 to 38400. [2024-10-11 04:53:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38400 states, 38398 states have (on average 1.4427313922600136) internal successors, (55398), 38399 states have internal predecessors, (55398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38400 states to 38400 states and 55398 transitions. [2024-10-11 04:53:31,185 INFO L78 Accepts]: Start accepts. Automaton has 38400 states and 55398 transitions. Word has length 86 [2024-10-11 04:53:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:31,185 INFO L471 AbstractCegarLoop]: Abstraction has 38400 states and 55398 transitions. [2024-10-11 04:53:31,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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-11 04:53:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 38400 states and 55398 transitions. [2024-10-11 04:53:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:31,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:31,189 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] [2024-10-11 04:53:31,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:53:31,190 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:31,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash 712575559, now seen corresponding path program 1 times [2024-10-11 04:53:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373814101] [2024-10-11 04:53:31,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:53:31,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:31,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373814101] [2024-10-11 04:53:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373814101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:31,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090834464] [2024-10-11 04:53:31,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:31,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:31,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:31,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:31,421 INFO L87 Difference]: Start difference. First operand 38400 states and 55398 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:33,646 INFO L93 Difference]: Finished difference Result 75822 states and 109869 transitions. [2024-10-11 04:53:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:33,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 86 [2024-10-11 04:53:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:33,733 INFO L225 Difference]: With dead ends: 75822 [2024-10-11 04:53:33,733 INFO L226 Difference]: Without dead ends: 69260 [2024-10-11 04:53:33,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:33,757 INFO L432 NwaCegarLoop]: 1634 mSDtfsCounter, 8026 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8026 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:33,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8026 Valid, 4032 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69260 states. [2024-10-11 04:53:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69260 to 44960. [2024-10-11 04:53:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44960 states, 44958 states have (on average 1.4421904889007517) internal successors, (64838), 44959 states have internal predecessors, (64838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44960 states to 44960 states and 64838 transitions. [2024-10-11 04:53:35,206 INFO L78 Accepts]: Start accepts. Automaton has 44960 states and 64838 transitions. Word has length 86 [2024-10-11 04:53:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:35,207 INFO L471 AbstractCegarLoop]: Abstraction has 44960 states and 64838 transitions. [2024-10-11 04:53:35,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 44960 states and 64838 transitions. [2024-10-11 04:53:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 04:53:35,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:35,212 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] [2024-10-11 04:53:35,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:53:35,212 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:35,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1343316655, now seen corresponding path program 1 times [2024-10-11 04:53:35,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:35,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584003528] [2024-10-11 04:53:35,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:35,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:35,340 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-11 04:53:35,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584003528] [2024-10-11 04:53:35,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584003528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:35,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:35,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471436669] [2024-10-11 04:53:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:35,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:35,342 INFO L87 Difference]: Start difference. First operand 44960 states and 64838 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:36,537 INFO L93 Difference]: Finished difference Result 74937 states and 108542 transitions. [2024-10-11 04:53:36,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:36,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-11 04:53:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:36,585 INFO L225 Difference]: With dead ends: 74937 [2024-10-11 04:53:36,585 INFO L226 Difference]: Without dead ends: 32279 [2024-10-11 04:53:36,604 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-11 04:53:36,604 INFO L432 NwaCegarLoop]: 1607 mSDtfsCounter, 58 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:36,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3152 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32279 states. [2024-10-11 04:53:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32279 to 32277. [2024-10-11 04:53:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32277 states, 32275 states have (on average 1.4483965917893107) internal successors, (46747), 32276 states have internal predecessors, (46747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32277 states to 32277 states and 46747 transitions. [2024-10-11 04:53:37,464 INFO L78 Accepts]: Start accepts. Automaton has 32277 states and 46747 transitions. Word has length 88 [2024-10-11 04:53:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:37,465 INFO L471 AbstractCegarLoop]: Abstraction has 32277 states and 46747 transitions. [2024-10-11 04:53:37,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 32277 states and 46747 transitions. [2024-10-11 04:53:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 04:53:37,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:37,467 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] [2024-10-11 04:53:37,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:53:37,467 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:37,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2082755052, now seen corresponding path program 1 times [2024-10-11 04:53:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055552930] [2024-10-11 04:53:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:53:37,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:37,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055552930] [2024-10-11 04:53:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055552930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:37,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349395167] [2024-10-11 04:53:37,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:37,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:37,763 INFO L87 Difference]: Start difference. First operand 32277 states and 46747 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:39,316 INFO L93 Difference]: Finished difference Result 59939 states and 87074 transitions. [2024-10-11 04:53:39,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:39,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 88 [2024-10-11 04:53:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:39,383 INFO L225 Difference]: With dead ends: 59939 [2024-10-11 04:53:39,383 INFO L226 Difference]: Without dead ends: 55329 [2024-10-11 04:53:39,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:39,394 INFO L432 NwaCegarLoop]: 1625 mSDtfsCounter, 8038 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8038 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:39,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8038 Valid, 3966 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55329 states. [2024-10-11 04:53:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55329 to 36885. [2024-10-11 04:53:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 36883 states have (on average 1.4479028278610742) internal successors, (53403), 36884 states have internal predecessors, (53403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 53403 transitions. [2024-10-11 04:53:40,510 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 53403 transitions. Word has length 88 [2024-10-11 04:53:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:40,510 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 53403 transitions. [2024-10-11 04:53:40,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 53403 transitions. [2024-10-11 04:53:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:53:40,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:40,513 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] [2024-10-11 04:53:40,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 04:53:40,513 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:40,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:40,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1555080975, now seen corresponding path program 1 times [2024-10-11 04:53:40,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:40,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390888911] [2024-10-11 04:53:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:40,607 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-11 04:53:40,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390888911] [2024-10-11 04:53:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390888911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:40,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566888885] [2024-10-11 04:53:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:40,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:40,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:40,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:40,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:40,610 INFO L87 Difference]: Start difference. First operand 36885 states and 53403 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:41,041 INFO L93 Difference]: Finished difference Result 54169 states and 78365 transitions. [2024-10-11 04:53:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-11 04:53:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:41,068 INFO L225 Difference]: With dead ends: 54169 [2024-10-11 04:53:41,069 INFO L226 Difference]: Without dead ends: 19607 [2024-10-11 04:53:41,098 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-11 04:53:41,099 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 53 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:41,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19607 states. [2024-10-11 04:53:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19607 to 19605. [2024-10-11 04:53:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19605 states, 19603 states have (on average 1.4387083609651583) internal successors, (28203), 19604 states have internal predecessors, (28203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19605 states to 19605 states and 28203 transitions. [2024-10-11 04:53:41,853 INFO L78 Accepts]: Start accepts. Automaton has 19605 states and 28203 transitions. Word has length 89 [2024-10-11 04:53:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:41,853 INFO L471 AbstractCegarLoop]: Abstraction has 19605 states and 28203 transitions. [2024-10-11 04:53:41,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 19605 states and 28203 transitions. [2024-10-11 04:53:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:53:41,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:41,856 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] [2024-10-11 04:53:41,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 04:53:41,857 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:41,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash 433774111, now seen corresponding path program 1 times [2024-10-11 04:53:41,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:41,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466416183] [2024-10-11 04:53:41,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:41,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:41,977 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-11 04:53:41,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:41,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466416183] [2024-10-11 04:53:41,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466416183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:41,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:41,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775080491] [2024-10-11 04:53:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:41,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:41,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:41,981 INFO L87 Difference]: Start difference. First operand 19605 states and 28203 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-11 04:53:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:42,314 INFO L93 Difference]: Finished difference Result 28249 states and 40565 transitions. [2024-10-11 04:53:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:42,314 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 91 [2024-10-11 04:53:42,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:42,331 INFO L225 Difference]: With dead ends: 28249 [2024-10-11 04:53:42,331 INFO L226 Difference]: Without dead ends: 10967 [2024-10-11 04:53:42,345 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-11 04:53:42,346 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 50 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3122 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:42,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3122 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10967 states. [2024-10-11 04:53:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10967 to 10965. [2024-10-11 04:53:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10965 states, 10963 states have (on average 1.4341877223387758) internal successors, (15723), 10964 states have internal predecessors, (15723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10965 states to 10965 states and 15723 transitions. [2024-10-11 04:53:42,798 INFO L78 Accepts]: Start accepts. Automaton has 10965 states and 15723 transitions. Word has length 91 [2024-10-11 04:53:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:42,798 INFO L471 AbstractCegarLoop]: Abstraction has 10965 states and 15723 transitions. [2024-10-11 04:53:42,798 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-11 04:53:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 10965 states and 15723 transitions. [2024-10-11 04:53:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:53:42,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:42,800 INFO L215 NwaCegarLoop]: trace histogram [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-11 04:53:42,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 04:53:42,800 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:42,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash 475149517, now seen corresponding path program 1 times [2024-10-11 04:53:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748236193] [2024-10-11 04:53:42,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:42,906 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-11 04:53:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748236193] [2024-10-11 04:53:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748236193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089272455] [2024-10-11 04:53:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:42,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:42,908 INFO L87 Difference]: Start difference. First operand 10965 states and 15723 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:43,059 INFO L93 Difference]: Finished difference Result 15289 states and 21845 transitions. [2024-10-11 04:53:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:43,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 04:53:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:43,070 INFO L225 Difference]: With dead ends: 15289 [2024-10-11 04:53:43,070 INFO L226 Difference]: Without dead ends: 6647 [2024-10-11 04:53:43,078 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-11 04:53:43,078 INFO L432 NwaCegarLoop]: 1586 mSDtfsCounter, 47 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:43,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3107 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6647 states. [2024-10-11 04:53:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6647 to 6645. [2024-10-11 04:53:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6645 states, 6643 states have (on average 1.4365497516182448) internal successors, (9543), 6644 states have internal predecessors, (9543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6645 states to 6645 states and 9543 transitions. [2024-10-11 04:53:43,209 INFO L78 Accepts]: Start accepts. Automaton has 6645 states and 9543 transitions. Word has length 93 [2024-10-11 04:53:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:43,210 INFO L471 AbstractCegarLoop]: Abstraction has 6645 states and 9543 transitions. [2024-10-11 04:53:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6645 states and 9543 transitions. [2024-10-11 04:53:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 04:53:43,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:43,211 INFO L215 NwaCegarLoop]: trace histogram [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-11 04:53:43,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 04:53:43,211 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1948500741, now seen corresponding path program 1 times [2024-10-11 04:53:43,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:43,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38544051] [2024-10-11 04:53:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:43,306 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-11 04:53:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38544051] [2024-10-11 04:53:43,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38544051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:43,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:43,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104631797] [2024-10-11 04:53:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:43,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:43,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:43,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:43,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:43,309 INFO L87 Difference]: Start difference. First operand 6645 states and 9543 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:43,537 INFO L93 Difference]: Finished difference Result 8809 states and 12575 transitions. [2024-10-11 04:53:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 04:53:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:43,546 INFO L225 Difference]: With dead ends: 8809 [2024-10-11 04:53:43,546 INFO L226 Difference]: Without dead ends: 4487 [2024-10-11 04:53:43,549 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-11 04:53:43,550 INFO L432 NwaCegarLoop]: 1579 mSDtfsCounter, 44 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:43,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3092 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2024-10-11 04:53:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2024-10-11 04:53:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4483 states have (on average 1.4461298237787197) internal successors, (6483), 4484 states have internal predecessors, (6483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6483 transitions. [2024-10-11 04:53:43,652 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6483 transitions. Word has length 95 [2024-10-11 04:53:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:43,652 INFO L471 AbstractCegarLoop]: Abstraction has 4485 states and 6483 transitions. [2024-10-11 04:53:43,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6483 transitions. [2024-10-11 04:53:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 04:53:43,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:43,654 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] [2024-10-11 04:53:43,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 04:53:43,654 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:43,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1337448105, now seen corresponding path program 1 times [2024-10-11 04:53:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:43,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586671971] [2024-10-11 04:53:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:43,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:43,749 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-11 04:53:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586671971] [2024-10-11 04:53:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586671971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729857532] [2024-10-11 04:53:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:43,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:43,752 INFO L87 Difference]: Start difference. First operand 4485 states and 6483 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:43,808 INFO L93 Difference]: Finished difference Result 5569 states and 7985 transitions. [2024-10-11 04:53:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:43,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-10-11 04:53:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:43,814 INFO L225 Difference]: With dead ends: 5569 [2024-10-11 04:53:43,815 INFO L226 Difference]: Without dead ends: 3407 [2024-10-11 04:53:43,817 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-11 04:53:43,818 INFO L432 NwaCegarLoop]: 1572 mSDtfsCounter, 41 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:43,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3077 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2024-10-11 04:53:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3405. [2024-10-11 04:53:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 3403 states have (on average 1.4598883338230972) internal successors, (4968), 3404 states have internal predecessors, (4968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 4968 transitions. [2024-10-11 04:53:43,883 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 4968 transitions. Word has length 97 [2024-10-11 04:53:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:43,883 INFO L471 AbstractCegarLoop]: Abstraction has 3405 states and 4968 transitions. [2024-10-11 04:53:43,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 4968 transitions. [2024-10-11 04:53:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 04:53:43,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:43,884 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 04:53:43,885 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash 54256087, now seen corresponding path program 1 times [2024-10-11 04:53:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140062884] [2024-10-11 04:53:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:53:44,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:44,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140062884] [2024-10-11 04:53:44,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140062884] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:53:44,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130412671] [2024-10-11 04:53:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:44,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:53:44,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:53:44,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:53:44,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:53:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:44,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:53:44,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:53:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:53:45,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:53:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:53:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130412671] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:53:46,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:53:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-10-11 04:53:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681640740] [2024-10-11 04:53:46,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:53:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 04:53:46,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:46,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 04:53:46,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-10-11 04:53:46,339 INFO L87 Difference]: Start difference. First operand 3405 states and 4968 transitions. Second operand has 25 states, 25 states have (on average 10.48) internal successors, (262), 24 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:48,305 INFO L93 Difference]: Finished difference Result 7919 states and 11185 transitions. [2024-10-11 04:53:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 04:53:48,305 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.48) internal successors, (262), 24 states have internal predecessors, (262), 0 states have call successors, (0), 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-11 04:53:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:48,314 INFO L225 Difference]: With dead ends: 7919 [2024-10-11 04:53:48,314 INFO L226 Difference]: Without dead ends: 6837 [2024-10-11 04:53:48,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=629, Invalid=2233, Unknown=0, NotChecked=0, Total=2862 [2024-10-11 04:53:48,317 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 21213 mSDsluCounter, 5022 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21213 SdHoareTripleChecker+Valid, 6528 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:48,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21213 Valid, 6528 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:53:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6837 states. [2024-10-11 04:53:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6837 to 6765. [2024-10-11 04:53:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6765 states, 6763 states have (on average 1.4021883779387845) internal successors, (9483), 6764 states have internal predecessors, (9483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6765 states to 6765 states and 9483 transitions. [2024-10-11 04:53:48,465 INFO L78 Accepts]: Start accepts. Automaton has 6765 states and 9483 transitions. Word has length 99 [2024-10-11 04:53:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:48,466 INFO L471 AbstractCegarLoop]: Abstraction has 6765 states and 9483 transitions. [2024-10-11 04:53:48,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.48) internal successors, (262), 24 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 6765 states and 9483 transitions. [2024-10-11 04:53:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:53:48,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:48,468 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:48,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:53:48,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 04:53:48,669 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:48,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash -256420804, now seen corresponding path program 1 times [2024-10-11 04:53:48,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:48,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245810253] [2024-10-11 04:53:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:53:50,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245810253] [2024-10-11 04:53:50,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245810253] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:53:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299226771] [2024-10-11 04:53:50,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:50,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:53:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:53:50,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:53:50,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:53:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:50,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 04:53:50,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:53:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:53:51,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:53:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:53:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299226771] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:53:53,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:53:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 14] total 40 [2024-10-11 04:53:53,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916122793] [2024-10-11 04:53:53,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:53:53,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 04:53:53,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:53,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 04:53:53,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 04:53:53,335 INFO L87 Difference]: Start difference. First operand 6765 states and 9483 transitions. Second operand has 40 states, 40 states have (on average 6.75) internal successors, (270), 40 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:58,977 INFO L93 Difference]: Finished difference Result 36309 states and 49485 transitions. [2024-10-11 04:53:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-11 04:53:58,978 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 6.75) internal successors, (270), 40 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-11 04:53:58,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:59,013 INFO L225 Difference]: With dead ends: 36309 [2024-10-11 04:53:59,013 INFO L226 Difference]: Without dead ends: 31867 [2024-10-11 04:53:59,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2953 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1906, Invalid=8194, Unknown=0, NotChecked=0, Total=10100 [2024-10-11 04:53:59,022 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 24180 mSDsluCounter, 8707 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24180 SdHoareTripleChecker+Valid, 10251 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:59,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24180 Valid, 10251 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:53:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31867 states. [2024-10-11 04:53:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31867 to 31125. [2024-10-11 04:53:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31125 states, 31123 states have (on average 1.346688943867879) internal successors, (41913), 31124 states have internal predecessors, (41913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31125 states to 31125 states and 41913 transitions. [2024-10-11 04:54:00,036 INFO L78 Accepts]: Start accepts. Automaton has 31125 states and 41913 transitions. Word has length 100 [2024-10-11 04:54:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:00,037 INFO L471 AbstractCegarLoop]: Abstraction has 31125 states and 41913 transitions. [2024-10-11 04:54:00,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.75) internal successors, (270), 40 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 31125 states and 41913 transitions. [2024-10-11 04:54:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:54:00,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:00,040 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:00,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 04:54:00,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 04:54:00,242 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:00,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash 387149573, now seen corresponding path program 1 times [2024-10-11 04:54:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:00,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483508907] [2024-10-11 04:54:00,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:00,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:00,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483508907] [2024-10-11 04:54:00,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483508907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:00,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759343476] [2024-10-11 04:54:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:00,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:00,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:00,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:00,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:54:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:00,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:54:00,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:01,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:54:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:02,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759343476] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:54:02,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:54:02,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-11 04:54:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672597071] [2024-10-11 04:54:02,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:54:02,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 04:54:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 04:54:02,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:54:02,088 INFO L87 Difference]: Start difference. First operand 31125 states and 41913 transitions. Second operand has 23 states, 23 states have (on average 10.652173913043478) internal successors, (245), 22 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:04,291 INFO L93 Difference]: Finished difference Result 91251 states and 122556 transitions. [2024-10-11 04:54:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:54:04,291 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.652173913043478) internal successors, (245), 22 states have internal predecessors, (245), 0 states have call successors, (0), 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 101 [2024-10-11 04:54:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:04,367 INFO L225 Difference]: With dead ends: 91251 [2024-10-11 04:54:04,367 INFO L226 Difference]: Without dead ends: 62449 [2024-10-11 04:54:04,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 04:54:04,401 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 13961 mSDsluCounter, 6387 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13961 SdHoareTripleChecker+Valid, 7919 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:04,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13961 Valid, 7919 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:54:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62449 states. [2024-10-11 04:54:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62449 to 61605. [2024-10-11 04:54:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61605 states, 61603 states have (on average 1.3246595133353896) internal successors, (81603), 61604 states have internal predecessors, (81603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61605 states to 61605 states and 81603 transitions. [2024-10-11 04:54:06,943 INFO L78 Accepts]: Start accepts. Automaton has 61605 states and 81603 transitions. Word has length 101 [2024-10-11 04:54:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 61605 states and 81603 transitions. [2024-10-11 04:54:06,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.652173913043478) internal successors, (245), 22 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 61605 states and 81603 transitions. [2024-10-11 04:54:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:54:06,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:06,948 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:06,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:54:07,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:07,149 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:07,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1493735660, now seen corresponding path program 1 times [2024-10-11 04:54:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180463431] [2024-10-11 04:54:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180463431] [2024-10-11 04:54:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180463431] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880352765] [2024-10-11 04:54:07,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:07,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:07,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:07,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:07,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:54:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:07,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 04:54:07,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:10,602 INFO L311 TraceCheckSpWp]: Computing backward predicates...