./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.8.ufo.UNBOUNDED.pals+Problem12_label03.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.8.ufo.UNBOUNDED.pals+Problem12_label03.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 5d6ca24940c3ee50144301bfe2ad5c39a9e1b17caba3dcee976fe158697f7f6f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:58:45,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:58:45,406 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:58:45,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:58:45,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:58:45,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:58:45,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:58:45,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:58:45,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:58:45,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:58:45,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:58:45,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:58:45,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:58:45,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:58:45,452 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:58:45,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:58:45,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:58:45,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:58:45,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:58:45,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:58:45,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:58:45,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:58:45,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:58:45,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:58:45,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:58:45,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:58:45,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:58:45,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:58:45,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:58:45,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:58:45,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:58:45,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:58:45,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:58:45,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:58:45,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:58:45,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:58:45,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:58:45,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:58:45,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:58:45,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:58:45,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:58:45,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:58:45,464 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 -> 5d6ca24940c3ee50144301bfe2ad5c39a9e1b17caba3dcee976fe158697f7f6f [2024-10-11 04:58:45,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:58:45,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:58:45,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:58:45,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:58:45,775 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:58:45,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-11 04:58:47,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:58:47,753 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:58:47,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-11 04:58:47,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e1898819a/4321365e364542a8a76b4746937532b4/FLAG6e66b41fd [2024-10-11 04:58:48,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e1898819a/4321365e364542a8a76b4746937532b4 [2024-10-11 04:58:48,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:58:48,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:58:48,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:58:48,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:58:48,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:58:48,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:58:48" (1/1) ... [2024-10-11 04:58:48,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b34e765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:48, skipping insertion in model container [2024-10-11 04:58:48,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:58:48" (1/1) ... [2024-10-11 04:58:48,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:58:49,016 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[26888,26901] [2024-10-11 04:58:49,064 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[29225,29238] [2024-10-11 04:58:49,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:58:49,776 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:58:49,815 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[26888,26901] [2024-10-11 04:58:49,820 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[29225,29238] [2024-10-11 04:58:50,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:58:50,255 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:58:50,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50 WrapperNode [2024-10-11 04:58:50,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:58:50,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:58:50,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:58:50,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:58:50,264 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:58:50" (1/1) ... [2024-10-11 04:58:50,334 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:58:50" (1/1) ... [2024-10-11 04:58:50,653 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-10-11 04:58:50,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:58:50,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:58:50,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:58:50,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:58:50,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:50,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:50,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:51,044 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:58:51,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:51,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:51,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:51,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:51,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:51,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:51,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:58:51,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:58:51,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:58:51,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:58:51,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (1/1) ... [2024-10-11 04:58:51,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:58:51,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:58:51,567 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:58:51,570 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:58:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:58:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:58:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:58:51,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:58:51,765 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:58:51,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:58:56,127 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-11 04:58:56,128 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:58:56,209 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:58:56,209 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:58:56,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:58:56 BoogieIcfgContainer [2024-10-11 04:58:56,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:58:56,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:58:56,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:58:56,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:58:56,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:58:48" (1/3) ... [2024-10-11 04:58:56,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6964e755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:58:56, skipping insertion in model container [2024-10-11 04:58:56,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:50" (2/3) ... [2024-10-11 04:58:56,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6964e755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:58:56, skipping insertion in model container [2024-10-11 04:58:56,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:58:56" (3/3) ... [2024-10-11 04:58:56,221 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-11 04:58:56,238 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:58:56,238 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:58:56,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:58:56,336 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;@11bb2a50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:58:56,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:58:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states 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:58:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 04:58:56,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:56,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:58:56,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:56,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1712849582, now seen corresponding path program 1 times [2024-10-11 04:58:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:56,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837377519] [2024-10-11 04:58:56,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:56,656 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:58:56,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:56,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837377519] [2024-10-11 04:58:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837377519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:56,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:58:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641061828] [2024-10-11 04:58:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:56,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:58:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:56,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:58:56,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:58:56,698 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:58:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:56,815 INFO L93 Difference]: Finished difference Result 1702 states and 3341 transitions. [2024-10-11 04:58:56,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:58:56,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-11 04:58:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:56,844 INFO L225 Difference]: With dead ends: 1702 [2024-10-11 04:58:56,845 INFO L226 Difference]: Without dead ends: 880 [2024-10-11 04:58:56,852 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:58:56,855 INFO L432 NwaCegarLoop]: 1663 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, 1663 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:58:56,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1663 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:56,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-11 04:58:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-11 04:58:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8952164009111618) internal successors, (1664), 879 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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:58:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1664 transitions. [2024-10-11 04:58:56,956 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1664 transitions. Word has length 19 [2024-10-11 04:58:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:56,957 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1664 transitions. [2024-10-11 04:58:56,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:58:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1664 transitions. [2024-10-11 04:58:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 04:58:56,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:56,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:58:56,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:58:56,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:56,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1208531677, now seen corresponding path program 1 times [2024-10-11 04:58:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:56,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127994917] [2024-10-11 04:58:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:57,156 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:58:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127994917] [2024-10-11 04:58:57,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127994917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:57,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:57,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:58:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905363626] [2024-10-11 04:58:57,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:57,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:57,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:57,162 INFO L87 Difference]: Start difference. First operand 880 states and 1664 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:59:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:00,311 INFO L93 Difference]: Finished difference Result 2384 states and 4537 transitions. [2024-10-11 04:59:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:00,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-11 04:59:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:00,319 INFO L225 Difference]: With dead ends: 2384 [2024-10-11 04:59:00,320 INFO L226 Difference]: Without dead ends: 1631 [2024-10-11 04:59:00,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:00,323 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 1024 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:00,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 650 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 04:59:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-10-11 04:59:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-10-11 04:59:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6519337016574585) internal successors, (2691), 1630 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states 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:59:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2691 transitions. [2024-10-11 04:59:00,371 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2691 transitions. Word has length 19 [2024-10-11 04:59:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:00,371 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2691 transitions. [2024-10-11 04:59:00,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:59:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2691 transitions. [2024-10-11 04:59:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:59:00,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:00,373 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] [2024-10-11 04:59:00,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:59:00,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:00,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1038166230, now seen corresponding path program 1 times [2024-10-11 04:59:00,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:00,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933647683] [2024-10-11 04:59:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:00,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:00,558 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:59:00,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933647683] [2024-10-11 04:59:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933647683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:00,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:59:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679969682] [2024-10-11 04:59:00,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:00,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:59:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:00,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:59:00,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:59:00,560 INFO L87 Difference]: Start difference. First operand 1631 states and 2691 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:59:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:00,662 INFO L93 Difference]: Finished difference Result 1695 states and 2793 transitions. [2024-10-11 04:59:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:59:00,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-11 04:59:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:00,671 INFO L225 Difference]: With dead ends: 1695 [2024-10-11 04:59:00,672 INFO L226 Difference]: Without dead ends: 1631 [2024-10-11 04:59:00,676 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:59:00,678 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 0 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:00,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4918 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:59:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-10-11 04:59:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-10-11 04:59:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.614487415592388) internal successors, (2630), 1630 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states 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:59:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2630 transitions. [2024-10-11 04:59:00,719 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2630 transitions. Word has length 27 [2024-10-11 04:59:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:00,720 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2630 transitions. [2024-10-11 04:59:00,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:59:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2630 transitions. [2024-10-11 04:59:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 04:59:00,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:00,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:00,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:59:00,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:00,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 64150534, now seen corresponding path program 1 times [2024-10-11 04:59:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323141347] [2024-10-11 04:59:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:00,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:01,166 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:59:01,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:01,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323141347] [2024-10-11 04:59:01,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323141347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:01,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:01,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:59:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538640014] [2024-10-11 04:59:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:01,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:59:01,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:01,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:59:01,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:59:01,171 INFO L87 Difference]: Start difference. First operand 1631 states and 2630 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:59:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:01,817 INFO L93 Difference]: Finished difference Result 2607 states and 4214 transitions. [2024-10-11 04:59:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 04:59:01,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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 87 [2024-10-11 04:59:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:01,829 INFO L225 Difference]: With dead ends: 2607 [2024-10-11 04:59:01,830 INFO L226 Difference]: Without dead ends: 2546 [2024-10-11 04:59:01,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:59:01,835 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 13544 mSDsluCounter, 3889 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13544 SdHoareTripleChecker+Valid, 5483 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:01,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13544 Valid, 5483 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:59:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-10-11 04:59:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1690. [2024-10-11 04:59:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.6149289099526067) internal successors, (2726), 1689 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states 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:59:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2726 transitions. [2024-10-11 04:59:01,893 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2726 transitions. Word has length 87 [2024-10-11 04:59:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:01,894 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2726 transitions. [2024-10-11 04:59:01,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:59:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2726 transitions. [2024-10-11 04:59:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:59:01,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:01,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:01,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:59:01,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:01,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1377992502, now seen corresponding path program 1 times [2024-10-11 04:59:01,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:01,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353655990] [2024-10-11 04:59:01,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:01,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:02,090 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:59:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:02,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353655990] [2024-10-11 04:59:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353655990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:02,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:02,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:59:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968151062] [2024-10-11 04:59:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:02,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:02,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:02,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:02,093 INFO L87 Difference]: Start difference. First operand 1690 states and 2726 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:59:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:02,155 INFO L93 Difference]: Finished difference Result 1919 states and 3097 transitions. [2024-10-11 04:59:02,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:02,156 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:59:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:02,163 INFO L225 Difference]: With dead ends: 1919 [2024-10-11 04:59:02,164 INFO L226 Difference]: Without dead ends: 1799 [2024-10-11 04:59:02,165 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:59:02,166 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 1506 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1687 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:59:02,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1687 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-11 04:59:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1795. [2024-10-11 04:59:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.6140546569994423) internal successors, (2894), 1794 states have internal predecessors, (2894), 0 states have call successors, (0), 0 states 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:59:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2894 transitions. [2024-10-11 04:59:02,214 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2894 transitions. Word has length 89 [2024-10-11 04:59:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:02,215 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2894 transitions. [2024-10-11 04:59:02,215 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:59:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2894 transitions. [2024-10-11 04:59:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:59:02,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:02,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:02,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:59:02,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:02,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1380137454, now seen corresponding path program 1 times [2024-10-11 04:59:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392107575] [2024-10-11 04:59:02,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:02,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:02,796 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:59:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:02,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392107575] [2024-10-11 04:59:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392107575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:02,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:59:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364609753] [2024-10-11 04:59:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:02,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:59:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:59:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:59:02,799 INFO L87 Difference]: Start difference. First operand 1795 states and 2894 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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:59:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:03,321 INFO L93 Difference]: Finished difference Result 2022 states and 3258 transitions. [2024-10-11 04:59:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:59:03,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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:59:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:03,332 INFO L225 Difference]: With dead ends: 2022 [2024-10-11 04:59:03,333 INFO L226 Difference]: Without dead ends: 1797 [2024-10-11 04:59:03,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:59:03,338 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 6112 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6112 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:03,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6112 Valid, 2264 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:59:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2024-10-11 04:59:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1795. [2024-10-11 04:59:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.6129392080312326) internal successors, (2892), 1794 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states 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:59:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2892 transitions. [2024-10-11 04:59:03,385 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2892 transitions. Word has length 89 [2024-10-11 04:59:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:03,386 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2892 transitions. [2024-10-11 04:59:03,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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:59:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2892 transitions. [2024-10-11 04:59:03,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 04:59:03,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:03,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:03,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:59:03,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:03,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:03,391 INFO L85 PathProgramCache]: Analyzing trace with hash -294342910, now seen corresponding path program 1 times [2024-10-11 04:59:03,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:03,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117458969] [2024-10-11 04:59:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:03,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:03,633 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:59:03,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117458969] [2024-10-11 04:59:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117458969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:03,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:03,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:59:03,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531936520] [2024-10-11 04:59:03,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:03,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:59:03,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:03,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:59:03,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:59:03,636 INFO L87 Difference]: Start difference. First operand 1795 states and 2892 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:59:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:03,686 INFO L93 Difference]: Finished difference Result 1801 states and 2899 transitions. [2024-10-11 04:59:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:59:03,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-11 04:59:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:03,695 INFO L225 Difference]: With dead ends: 1801 [2024-10-11 04:59:03,695 INFO L226 Difference]: Without dead ends: 1799 [2024-10-11 04:59:03,696 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:59:03,697 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4789 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:59:03,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4789 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-11 04:59:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2024-10-11 04:59:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1797 states have (on average 1.6110183639398998) internal successors, (2895), 1798 states have internal predecessors, (2895), 0 states have call successors, (0), 0 states 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:59:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2895 transitions. [2024-10-11 04:59:03,740 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2895 transitions. Word has length 90 [2024-10-11 04:59:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:03,741 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2895 transitions. [2024-10-11 04:59:03,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:59:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2895 transitions. [2024-10-11 04:59:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 04:59:03,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:03,743 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:03,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:59:03,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:03,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1795733988, now seen corresponding path program 1 times [2024-10-11 04:59:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:03,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350412351] [2024-10-11 04:59:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:03,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 04:59:03,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:03,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350412351] [2024-10-11 04:59:03,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350412351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:03,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:03,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:59:03,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812279806] [2024-10-11 04:59:03,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:03,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:03,838 INFO L87 Difference]: Start difference. First operand 1799 states and 2895 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 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:59:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:07,371 INFO L93 Difference]: Finished difference Result 4805 states and 7822 transitions. [2024-10-11 04:59:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:07,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 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 90 [2024-10-11 04:59:07,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:07,385 INFO L225 Difference]: With dead ends: 4805 [2024-10-11 04:59:07,385 INFO L226 Difference]: Without dead ends: 3301 [2024-10-11 04:59:07,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:07,389 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 890 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:07,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 636 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 04:59:07,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2024-10-11 04:59:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3301. [2024-10-11 04:59:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 3299 states have (on average 1.4292209760533494) internal successors, (4715), 3300 states have internal predecessors, (4715), 0 states have call successors, (0), 0 states 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:59:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 4715 transitions. [2024-10-11 04:59:07,459 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 4715 transitions. Word has length 90 [2024-10-11 04:59:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:07,460 INFO L471 AbstractCegarLoop]: Abstraction has 3301 states and 4715 transitions. [2024-10-11 04:59:07,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 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:59:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 4715 transitions. [2024-10-11 04:59:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:59:07,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:07,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:07,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:59:07,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:07,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1953030514, now seen corresponding path program 1 times [2024-10-11 04:59:07,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:07,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534275381] [2024-10-11 04:59:07,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:07,623 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:59:07,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:07,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534275381] [2024-10-11 04:59:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534275381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:07,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:07,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:59:07,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467362263] [2024-10-11 04:59:07,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:07,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:07,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:07,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:07,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:07,628 INFO L87 Difference]: Start difference. First operand 3301 states and 4715 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:59:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:07,667 INFO L93 Difference]: Finished difference Result 3743 states and 5415 transitions. [2024-10-11 04:59:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:07,668 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:59:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:07,679 INFO L225 Difference]: With dead ends: 3743 [2024-10-11 04:59:07,679 INFO L226 Difference]: Without dead ends: 3514 [2024-10-11 04:59:07,680 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:59:07,682 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 1525 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1778 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:59:07,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2024-10-11 04:59:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3512. [2024-10-11 04:59:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 3510 states have (on average 1.4376068376068376) internal successors, (5046), 3511 states have internal predecessors, (5046), 0 states have call successors, (0), 0 states 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:59:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5046 transitions. [2024-10-11 04:59:07,752 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5046 transitions. Word has length 91 [2024-10-11 04:59:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:07,752 INFO L471 AbstractCegarLoop]: Abstraction has 3512 states and 5046 transitions. [2024-10-11 04:59:07,753 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:59:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5046 transitions. [2024-10-11 04:59:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:59:07,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:07,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:07,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:59:07,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:07,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1197646450, now seen corresponding path program 1 times [2024-10-11 04:59:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:07,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974927378] [2024-10-11 04:59:07,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:07,852 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:59:07,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:07,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974927378] [2024-10-11 04:59:07,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974927378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:07,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:07,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:59:07,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54871544] [2024-10-11 04:59:07,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:07,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:07,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:07,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:07,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:07,855 INFO L87 Difference]: Start difference. First operand 3512 states and 5046 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:59:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:07,912 INFO L93 Difference]: Finished difference Result 4360 states and 6380 transitions. [2024-10-11 04:59:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:07,912 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:59:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:07,926 INFO L225 Difference]: With dead ends: 4360 [2024-10-11 04:59:07,927 INFO L226 Difference]: Without dead ends: 3920 [2024-10-11 04:59:07,930 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:59:07,930 INFO L432 NwaCegarLoop]: 1673 mSDtfsCounter, 1523 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1780 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:59:07,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2024-10-11 04:59:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3918. [2024-10-11 04:59:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3916 states have (on average 1.449438202247191) internal successors, (5676), 3917 states have internal predecessors, (5676), 0 states have call successors, (0), 0 states 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:59:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5676 transitions. [2024-10-11 04:59:08,016 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5676 transitions. Word has length 91 [2024-10-11 04:59:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:08,017 INFO L471 AbstractCegarLoop]: Abstraction has 3918 states and 5676 transitions. [2024-10-11 04:59:08,017 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:59:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5676 transitions. [2024-10-11 04:59:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:59:08,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:08,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:08,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:59:08,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:08,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1876616306, now seen corresponding path program 1 times [2024-10-11 04:59:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035062072] [2024-10-11 04:59:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:08,103 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:59:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:08,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035062072] [2024-10-11 04:59:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035062072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:59:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379917023] [2024-10-11 04:59:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:08,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:08,106 INFO L87 Difference]: Start difference. First operand 3918 states and 5676 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:59:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:08,162 INFO L93 Difference]: Finished difference Result 5546 states and 8214 transitions. [2024-10-11 04:59:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:08,163 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:59:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:08,192 INFO L225 Difference]: With dead ends: 5546 [2024-10-11 04:59:08,193 INFO L226 Difference]: Without dead ends: 4700 [2024-10-11 04:59:08,196 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:59:08,197 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 1519 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1776 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:59:08,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1776 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4700 states. [2024-10-11 04:59:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4700 to 4698. [2024-10-11 04:59:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4698 states, 4696 states have (on average 1.463373083475298) internal successors, (6872), 4697 states have internal predecessors, (6872), 0 states have call successors, (0), 0 states 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:59:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4698 states to 4698 states and 6872 transitions. [2024-10-11 04:59:08,305 INFO L78 Accepts]: Start accepts. Automaton has 4698 states and 6872 transitions. Word has length 91 [2024-10-11 04:59:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:08,305 INFO L471 AbstractCegarLoop]: Abstraction has 4698 states and 6872 transitions. [2024-10-11 04:59:08,305 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:59:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4698 states and 6872 transitions. [2024-10-11 04:59:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:59:08,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:08,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:08,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:59:08,307 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1836672370, now seen corresponding path program 1 times [2024-10-11 04:59:08,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:08,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385648783] [2024-10-11 04:59:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:08,397 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:59:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:08,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385648783] [2024-10-11 04:59:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385648783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:08,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:59:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124630934] [2024-10-11 04:59:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:08,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:08,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:08,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:08,400 INFO L87 Difference]: Start difference. First operand 4698 states and 6872 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:59:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:08,483 INFO L93 Difference]: Finished difference Result 7822 states and 11690 transitions. [2024-10-11 04:59:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:08,484 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:59:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:08,496 INFO L225 Difference]: With dead ends: 7822 [2024-10-11 04:59:08,497 INFO L226 Difference]: Without dead ends: 6196 [2024-10-11 04:59:08,501 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:59:08,502 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 1517 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1778 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:59:08,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2024-10-11 04:59:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 6194. [2024-10-11 04:59:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6194 states, 6192 states have (on average 1.475452196382429) internal successors, (9136), 6193 states have internal predecessors, (9136), 0 states have call successors, (0), 0 states 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:59:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 9136 transitions. [2024-10-11 04:59:08,655 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 9136 transitions. Word has length 91 [2024-10-11 04:59:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:08,656 INFO L471 AbstractCegarLoop]: Abstraction has 6194 states and 9136 transitions. [2024-10-11 04:59:08,656 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:59:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 9136 transitions. [2024-10-11 04:59:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:59:08,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:08,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:08,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:59:08,658 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:08,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1573594994, now seen corresponding path program 1 times [2024-10-11 04:59:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:08,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661200716] [2024-10-11 04:59:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:08,743 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:59:08,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:08,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661200716] [2024-10-11 04:59:08,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661200716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:08,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:08,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:59:08,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851409469] [2024-10-11 04:59:08,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:08,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:08,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:08,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:08,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:08,745 INFO L87 Difference]: Start difference. First operand 6194 states and 9136 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:59:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:08,919 INFO L93 Difference]: Finished difference Result 12182 states and 18258 transitions. [2024-10-11 04:59:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:08,920 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:59:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:08,938 INFO L225 Difference]: With dead ends: 12182 [2024-10-11 04:59:08,939 INFO L226 Difference]: Without dead ends: 9060 [2024-10-11 04:59:08,947 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:59:08,948 INFO L432 NwaCegarLoop]: 1647 mSDtfsCounter, 1513 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1774 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:59:08,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1774 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9060 states. [2024-10-11 04:59:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9060 to 9058. [2024-10-11 04:59:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9058 states, 9056 states have (on average 1.480565371024735) internal successors, (13408), 9057 states have internal predecessors, (13408), 0 states have call successors, (0), 0 states 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:59:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9058 states to 9058 states and 13408 transitions. [2024-10-11 04:59:09,174 INFO L78 Accepts]: Start accepts. Automaton has 9058 states and 13408 transitions. Word has length 91 [2024-10-11 04:59:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:09,174 INFO L471 AbstractCegarLoop]: Abstraction has 9058 states and 13408 transitions. [2024-10-11 04:59:09,174 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:59:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 9058 states and 13408 transitions. [2024-10-11 04:59:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:59:09,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:09,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:09,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:59:09,176 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:09,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1832638862, now seen corresponding path program 1 times [2024-10-11 04:59:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:09,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531814316] [2024-10-11 04:59:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:09,285 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:59:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:09,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531814316] [2024-10-11 04:59:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531814316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:09,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:59:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435925456] [2024-10-11 04:59:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:09,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:09,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:09,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:09,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:09,287 INFO L87 Difference]: Start difference. First operand 9058 states and 13408 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:59:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:09,495 INFO L93 Difference]: Finished difference Result 20518 states and 30626 transitions. [2024-10-11 04:59:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:09,496 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:59:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:09,527 INFO L225 Difference]: With dead ends: 20518 [2024-10-11 04:59:09,527 INFO L226 Difference]: Without dead ends: 14532 [2024-10-11 04:59:09,541 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:59:09,542 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 1515 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1780 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:59:09,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14532 states. [2024-10-11 04:59:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14532 to 14530. [2024-10-11 04:59:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14530 states, 14528 states have (on average 1.475770925110132) internal successors, (21440), 14529 states have internal predecessors, (21440), 0 states have call successors, (0), 0 states 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:59:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14530 states to 14530 states and 21440 transitions. [2024-10-11 04:59:10,101 INFO L78 Accepts]: Start accepts. Automaton has 14530 states and 21440 transitions. Word has length 91 [2024-10-11 04:59:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:10,101 INFO L471 AbstractCegarLoop]: Abstraction has 14530 states and 21440 transitions. [2024-10-11 04:59:10,101 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:59:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 14530 states and 21440 transitions. [2024-10-11 04:59:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:59:10,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:10,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:10,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:59:10,103 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:10,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1608033138, now seen corresponding path program 1 times [2024-10-11 04:59:10,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646031364] [2024-10-11 04:59:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:10,213 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:59:10,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:10,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646031364] [2024-10-11 04:59:10,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646031364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:10,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:10,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:59:10,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972002286] [2024-10-11 04:59:10,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:10,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:10,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:10,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:10,216 INFO L87 Difference]: Start difference. First operand 14530 states and 21440 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:59:10,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:10,674 INFO L93 Difference]: Finished difference Result 36422 states and 53826 transitions. [2024-10-11 04:59:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:10,674 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:59:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:10,727 INFO L225 Difference]: With dead ends: 36422 [2024-10-11 04:59:10,728 INFO L226 Difference]: Without dead ends: 24964 [2024-10-11 04:59:10,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:10,754 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 1521 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1782 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:59:10,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1782 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24964 states. [2024-10-11 04:59:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24964 to 24962. [2024-10-11 04:59:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24962 states, 24960 states have (on average 1.4615384615384615) internal successors, (36480), 24961 states have internal predecessors, (36480), 0 states have call successors, (0), 0 states 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:59:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24962 states to 24962 states and 36480 transitions. [2024-10-11 04:59:11,452 INFO L78 Accepts]: Start accepts. Automaton has 24962 states and 36480 transitions. Word has length 91 [2024-10-11 04:59:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:11,453 INFO L471 AbstractCegarLoop]: Abstraction has 24962 states and 36480 transitions. [2024-10-11 04:59:11,453 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:59:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 24962 states and 36480 transitions. [2024-10-11 04:59:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:59:11,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:11,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:11,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:59:11,455 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:11,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1270174003, now seen corresponding path program 1 times [2024-10-11 04:59:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:11,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920004540] [2024-10-11 04:59:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:11,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:11,540 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:59:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:11,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920004540] [2024-10-11 04:59:11,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920004540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:11,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:11,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:59:11,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335350166] [2024-10-11 04:59:11,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:11,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:11,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:11,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:11,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:11,544 INFO L87 Difference]: Start difference. First operand 24962 states and 36480 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:59:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:12,110 INFO L93 Difference]: Finished difference Result 47497 states and 70022 transitions. [2024-10-11 04:59:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:12,111 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:59:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:12,185 INFO L225 Difference]: With dead ends: 47497 [2024-10-11 04:59:12,185 INFO L226 Difference]: Without dead ends: 35462 [2024-10-11 04:59:12,207 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:59:12,208 INFO L432 NwaCegarLoop]: 1680 mSDtfsCounter, 1524 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1779 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:59:12,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1779 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:59:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35462 states. [2024-10-11 04:59:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35462 to 35460. [2024-10-11 04:59:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35460 states, 35458 states have (on average 1.4584578938462407) internal successors, (51714), 35459 states have internal predecessors, (51714), 0 states have call successors, (0), 0 states 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:59:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35460 states to 35460 states and 51714 transitions. [2024-10-11 04:59:13,187 INFO L78 Accepts]: Start accepts. Automaton has 35460 states and 51714 transitions. Word has length 93 [2024-10-11 04:59:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:13,187 INFO L471 AbstractCegarLoop]: Abstraction has 35460 states and 51714 transitions. [2024-10-11 04:59:13,188 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:59:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 35460 states and 51714 transitions. [2024-10-11 04:59:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 04:59:13,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:13,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:13,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:59:13,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:13,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:13,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2076472174, now seen corresponding path program 1 times [2024-10-11 04:59:13,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:13,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679582642] [2024-10-11 04:59:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:59:13,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679582642] [2024-10-11 04:59:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679582642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:13,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:59:13,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216737569] [2024-10-11 04:59:13,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:13,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:13,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:13,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:13,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:13,296 INFO L87 Difference]: Start difference. First operand 35460 states and 51714 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:59:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:17,007 INFO L93 Difference]: Finished difference Result 41470 states and 60281 transitions. [2024-10-11 04:59:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-11 04:59:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:17,084 INFO L225 Difference]: With dead ends: 41470 [2024-10-11 04:59:17,084 INFO L226 Difference]: Without dead ends: 38464 [2024-10-11 04:59:17,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:17,099 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 938 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:17,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 609 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 04:59:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38464 states. [2024-10-11 04:59:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38464 to 38464. [2024-10-11 04:59:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38464 states, 38462 states have (on average 1.4354687743747074) internal successors, (55211), 38463 states have internal predecessors, (55211), 0 states have call successors, (0), 0 states 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:59:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38464 states to 38464 states and 55211 transitions. [2024-10-11 04:59:18,264 INFO L78 Accepts]: Start accepts. Automaton has 38464 states and 55211 transitions. Word has length 94 [2024-10-11 04:59:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:18,264 INFO L471 AbstractCegarLoop]: Abstraction has 38464 states and 55211 transitions. [2024-10-11 04:59:18,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:59:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 38464 states and 55211 transitions. [2024-10-11 04:59:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:59:18,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:18,266 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:18,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:59:18,266 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:18,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:18,267 INFO L85 PathProgramCache]: Analyzing trace with hash -136290371, now seen corresponding path program 1 times [2024-10-11 04:59:18,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:18,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271283204] [2024-10-11 04:59:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:59:18,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:18,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271283204] [2024-10-11 04:59:18,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271283204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:18,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:18,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:59:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778660314] [2024-10-11 04:59:18,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:18,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:59:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:18,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:59:18,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:18,391 INFO L87 Difference]: Start difference. First operand 38464 states and 55211 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:59:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:21,749 INFO L93 Difference]: Finished difference Result 50484 states and 70773 transitions. [2024-10-11 04:59:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:59:21,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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:59:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:21,828 INFO L225 Difference]: With dead ends: 50484 [2024-10-11 04:59:21,828 INFO L226 Difference]: Without dead ends: 44474 [2024-10-11 04:59:21,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:59:21,848 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 1074 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:21,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 513 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:59:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44474 states. [2024-10-11 04:59:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44474 to 43721. [2024-10-11 04:59:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43721 states, 43719 states have (on average 1.4012671836043826) internal successors, (61262), 43720 states have internal predecessors, (61262), 0 states have call successors, (0), 0 states 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:59:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43721 states to 43721 states and 61262 transitions. [2024-10-11 04:59:23,185 INFO L78 Accepts]: Start accepts. Automaton has 43721 states and 61262 transitions. Word has length 100 [2024-10-11 04:59:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:23,185 INFO L471 AbstractCegarLoop]: Abstraction has 43721 states and 61262 transitions. [2024-10-11 04:59:23,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:59:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 43721 states and 61262 transitions. [2024-10-11 04:59:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:59:23,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:23,193 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:23,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:59:23,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:23,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1909067792, now seen corresponding path program 1 times [2024-10-11 04:59:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:23,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602172955] [2024-10-11 04:59:23,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:59:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:23,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602172955] [2024-10-11 04:59:23,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602172955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:23,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:23,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:59:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104754826] [2024-10-11 04:59:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:23,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:59:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:23,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:59:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:59:23,704 INFO L87 Difference]: Start difference. First operand 43721 states and 61262 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:28,453 INFO L93 Difference]: Finished difference Result 309211 states and 449239 transitions. [2024-10-11 04:59:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:59:28,454 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 115 [2024-10-11 04:59:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:29,074 INFO L225 Difference]: With dead ends: 309211 [2024-10-11 04:59:29,074 INFO L226 Difference]: Without dead ends: 276825 [2024-10-11 04:59:29,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:59:29,180 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 11808 mSDsluCounter, 3264 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11808 SdHoareTripleChecker+Valid, 4962 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:29,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11808 Valid, 4962 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:59:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276825 states. [2024-10-11 04:59:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276825 to 76105. [2024-10-11 04:59:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76105 states, 76103 states have (on average 1.422256678448944) internal successors, (108238), 76104 states have internal predecessors, (108238), 0 states have call successors, (0), 0 states 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:59:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76105 states to 76105 states and 108238 transitions. [2024-10-11 04:59:33,083 INFO L78 Accepts]: Start accepts. Automaton has 76105 states and 108238 transitions. Word has length 115 [2024-10-11 04:59:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:33,084 INFO L471 AbstractCegarLoop]: Abstraction has 76105 states and 108238 transitions. [2024-10-11 04:59:33,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 76105 states and 108238 transitions. [2024-10-11 04:59:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:59:33,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:33,093 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:33,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:59:33,093 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:33,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1630515440, now seen corresponding path program 1 times [2024-10-11 04:59:33,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:33,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635518411] [2024-10-11 04:59:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:59:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:33,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635518411] [2024-10-11 04:59:33,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635518411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:33,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:33,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:59:33,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620742701] [2024-10-11 04:59:33,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:33,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:59:33,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:33,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:59:33,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:59:33,389 INFO L87 Difference]: Start difference. First operand 76105 states and 108238 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:59:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:39,992 INFO L93 Difference]: Finished difference Result 341595 states and 496215 transitions. [2024-10-11 04:59:39,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:59:39,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 115 [2024-10-11 04:59:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:40,553 INFO L225 Difference]: With dead ends: 341595 [2024-10-11 04:59:40,554 INFO L226 Difference]: Without dead ends: 309209 [2024-10-11 04:59:40,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:59:40,627 INFO L432 NwaCegarLoop]: 1695 mSDtfsCounter, 11856 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11856 SdHoareTripleChecker+Valid, 4769 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:40,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11856 Valid, 4769 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:59:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309209 states. [2024-10-11 04:59:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309209 to 124745. [2024-10-11 04:59:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124745 states, 124743 states have (on average 1.4299960719238756) internal successors, (178382), 124744 states have internal predecessors, (178382), 0 states have call successors, (0), 0 states 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:59:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124745 states to 124745 states and 178382 transitions. [2024-10-11 04:59:46,110 INFO L78 Accepts]: Start accepts. Automaton has 124745 states and 178382 transitions. Word has length 115 [2024-10-11 04:59:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:46,110 INFO L471 AbstractCegarLoop]: Abstraction has 124745 states and 178382 transitions. [2024-10-11 04:59:46,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:59:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 124745 states and 178382 transitions. [2024-10-11 04:59:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:59:46,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:46,119 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:59:46,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 04:59:46,120 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:46,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:46,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1985482000, now seen corresponding path program 1 times [2024-10-11 04:59:46,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:46,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373691996] [2024-10-11 04:59:46,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:46,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:59:46,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:46,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373691996] [2024-10-11 04:59:46,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373691996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:46,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:46,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:59:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729988011] [2024-10-11 04:59:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:46,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:59:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:59:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:59:46,408 INFO L87 Difference]: Start difference. First operand 124745 states and 178382 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:59:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:54,287 INFO L93 Difference]: Finished difference Result 373979 states and 543191 transitions. [2024-10-11 04:59:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:59:54,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 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 115 [2024-10-11 04:59:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:54,935 INFO L225 Difference]: With dead ends: 373979 [2024-10-11 04:59:54,936 INFO L226 Difference]: Without dead ends: 341593 [2024-10-11 04:59:55,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:59:55,030 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 11923 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11923 SdHoareTripleChecker+Valid, 4797 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:55,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11923 Valid, 4797 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:59:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341593 states.