./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.BOUNDED-16.pals+Problem12_label05.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.BOUNDED-16.pals+Problem12_label05.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 814707fd20d5e6c26ff7c37a631e7717aed30ef7e6a1e8c64960ffc8d41abd55 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:58:11,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:58:11,054 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:11,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:58:11,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:58:11,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:58:11,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:58:11,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:58:11,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:58:11,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:58:11,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:58:11,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:58:11,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:58:11,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:58:11,082 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:58:11,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:58:11,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:58:11,083 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:58:11,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:58:11,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:58:11,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:58:11,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:58:11,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:58:11,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:58:11,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:58:11,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:58:11,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:58:11,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:58:11,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:58:11,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:58:11,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:58:11,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:58:11,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:58:11,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:58:11,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:58:11,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:58:11,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:58:11,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:58:11,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:58:11,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:58:11,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:58:11,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:58:11,096 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 -> 814707fd20d5e6c26ff7c37a631e7717aed30ef7e6a1e8c64960ffc8d41abd55 [2024-10-11 04:58:11,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:58:11,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:58:11,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:58:11,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:58:11,419 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:58:11,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c [2024-10-11 04:58:12,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:58:13,520 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:58:13,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c [2024-10-11 04:58:13,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/12e0bd9ee/f9e408a62f32405f9aa6f67944c60ac1/FLAG2e46f6d3e [2024-10-11 04:58:14,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/12e0bd9ee/f9e408a62f32405f9aa6f67944c60ac1 [2024-10-11 04:58:14,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:58:14,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:58:14,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:58:14,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:58:14,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:58:14,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:58:14" (1/1) ... [2024-10-11 04:58:14,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa164d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:14, skipping insertion in model container [2024-10-11 04:58:14,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:58:14" (1/1) ... [2024-10-11 04:58:14,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:58:14,665 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.BOUNDED-16.pals+Problem12_label05.c[26860,26873] [2024-10-11 04:58:14,734 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.BOUNDED-16.pals+Problem12_label05.c[33796,33809] [2024-10-11 04:58:15,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:58:15,420 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:58:15,474 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.BOUNDED-16.pals+Problem12_label05.c[26860,26873] [2024-10-11 04:58:15,491 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.BOUNDED-16.pals+Problem12_label05.c[33796,33809] [2024-10-11 04:58:15,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:58:15,939 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:58:15,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:15 WrapperNode [2024-10-11 04:58:15,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:58:15,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:58:15,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:58:15,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:58:15,948 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:15" (1/1) ... [2024-10-11 04:58:16,014 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:15" (1/1) ... [2024-10-11 04:58:16,322 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5293 [2024-10-11 04:58:16,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:58:16,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:58:16,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:58:16,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:58:16,335 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:15" (1/1) ... [2024-10-11 04:58:16,336 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:15" (1/1) ... [2024-10-11 04:58:16,469 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:15" (1/1) ... [2024-10-11 04:58:16,605 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:16,606 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:15" (1/1) ... [2024-10-11 04:58:16,606 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:15" (1/1) ... [2024-10-11 04:58:16,785 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:15" (1/1) ... [2024-10-11 04:58:16,825 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:15" (1/1) ... [2024-10-11 04:58:16,860 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:15" (1/1) ... [2024-10-11 04:58:16,881 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:15" (1/1) ... [2024-10-11 04:58:16,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:58:16,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:58:16,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:58:16,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:58:16,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:15" (1/1) ... [2024-10-11 04:58:16,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:58:16,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:58:16,996 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:16,999 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:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:58:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:58:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:58:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:58:17,239 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:58:17,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:58:21,885 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-11 04:58:21,886 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:58:21,965 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:58:21,966 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:58:21,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:58:21 BoogieIcfgContainer [2024-10-11 04:58:21,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:58:21,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:58:21,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:58:21,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:58:21,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:58:14" (1/3) ... [2024-10-11 04:58:21,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad49dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:58:21, skipping insertion in model container [2024-10-11 04:58:21,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:58:15" (2/3) ... [2024-10-11 04:58:21,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad49dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:58:21, skipping insertion in model container [2024-10-11 04:58:21,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:58:21" (3/3) ... [2024-10-11 04:58:21,978 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c [2024-10-11 04:58:21,996 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:58:21,996 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:58:22,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:58:22,100 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;@44649274, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:58:22,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:58:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 882 states, 879 states have (on average 1.9704209328782707) internal successors, (1732), 881 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states 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:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:58:22,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:22,121 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:58:22,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:22,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -31988621, now seen corresponding path program 1 times [2024-10-11 04:58:22,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:22,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586060236] [2024-10-11 04:58:22,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:22,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:22,533 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:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:22,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586060236] [2024-10-11 04:58:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586060236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:22,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:22,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:58:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658833327] [2024-10-11 04:58:22,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:22,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:58:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:22,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:58:22,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:58:22,568 INFO L87 Difference]: Start difference. First operand has 882 states, 879 states have (on average 1.9704209328782707) internal successors, (1732), 881 states have internal predecessors, (1732), 0 states have call successors, (0), 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 13.5) internal successors, (27), 2 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:58:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:22,701 INFO L93 Difference]: Finished difference Result 1699 states and 3336 transitions. [2024-10-11 04:58:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:58:22,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 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:58:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:22,732 INFO L225 Difference]: With dead ends: 1699 [2024-10-11 04:58:22,732 INFO L226 Difference]: Without dead ends: 878 [2024-10-11 04:58:22,742 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:22,749 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:22,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1661 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-11 04:58:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2024-10-11 04:58:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.8961187214611872) internal successors, (1661), 877 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states 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:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1661 transitions. [2024-10-11 04:58:22,845 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1661 transitions. Word has length 27 [2024-10-11 04:58:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:22,845 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1661 transitions. [2024-10-11 04:58:22,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 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:58:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1661 transitions. [2024-10-11 04:58:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:58:22,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:22,847 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:58:22,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:58:22,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:22,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1837426955, now seen corresponding path program 1 times [2024-10-11 04:58:22,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:22,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845887278] [2024-10-11 04:58:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:22,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:23,108 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:23,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:23,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845887278] [2024-10-11 04:58:23,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845887278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:23,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:23,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:58:23,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905165416] [2024-10-11 04:58:23,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:58:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:58:23,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:58:23,115 INFO L87 Difference]: Start difference. First operand 878 states and 1661 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:58:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:23,275 INFO L93 Difference]: Finished difference Result 940 states and 1760 transitions. [2024-10-11 04:58:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:58:23,276 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:58:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:23,281 INFO L225 Difference]: With dead ends: 940 [2024-10-11 04:58:23,281 INFO L226 Difference]: Without dead ends: 878 [2024-10-11 04:58:23,282 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:58:23,283 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 0 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4909 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:58:23,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4909 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:58:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-11 04:58:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2024-10-11 04:58:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.82648401826484) internal successors, (1600), 877 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states 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:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1600 transitions. [2024-10-11 04:58:23,307 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1600 transitions. Word has length 27 [2024-10-11 04:58:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:23,308 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1600 transitions. [2024-10-11 04:58:23,308 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:58:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1600 transitions. [2024-10-11 04:58:23,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:58:23,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:23,311 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] [2024-10-11 04:58:23,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:58:23,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:23,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash 992919510, now seen corresponding path program 1 times [2024-10-11 04:58:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:23,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737487609] [2024-10-11 04:58:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:23,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:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737487609] [2024-10-11 04:58:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737487609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330728053] [2024-10-11 04:58:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:58:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:58:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:58:23,662 INFO L87 Difference]: Start difference. First operand 878 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:29,997 INFO L93 Difference]: Finished difference Result 3133 states and 5909 transitions. [2024-10-11 04:58:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:58:29,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-10-11 04:58:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:30,008 INFO L225 Difference]: With dead ends: 3133 [2024-10-11 04:58:30,009 INFO L226 Difference]: Without dead ends: 2380 [2024-10-11 04:58:30,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:58:30,012 INFO L432 NwaCegarLoop]: 833 mSDtfsCounter, 2516 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5357 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2516 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 6510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:30,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2516 Valid, 851 Invalid, 6510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5357 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-11 04:58:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2024-10-11 04:58:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2024-10-11 04:58:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2378 states have (on average 1.5618166526492852) internal successors, (3714), 2379 states have internal predecessors, (3714), 0 states have call successors, (0), 0 states 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:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3714 transitions. [2024-10-11 04:58:30,081 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3714 transitions. Word has length 59 [2024-10-11 04:58:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:30,082 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3714 transitions. [2024-10-11 04:58:30,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3714 transitions. [2024-10-11 04:58:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 04:58:30,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:30,085 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:58:30,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:58:30,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:30,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash -470628699, now seen corresponding path program 1 times [2024-10-11 04:58:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:30,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274644878] [2024-10-11 04:58:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:30,567 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:30,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274644878] [2024-10-11 04:58:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274644878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:30,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:30,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:58:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476377045] [2024-10-11 04:58:30,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:30,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:58:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:58:30,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:58:30,572 INFO L87 Difference]: Start difference. First operand 2380 states and 3714 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:58:31,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:31,183 INFO L93 Difference]: Finished difference Result 3324 states and 5250 transitions. [2024-10-11 04:58:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 04:58:31,184 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:58:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:31,198 INFO L225 Difference]: With dead ends: 3324 [2024-10-11 04:58:31,198 INFO L226 Difference]: Without dead ends: 3265 [2024-10-11 04:58:31,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:58:31,201 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 13341 mSDsluCounter, 4679 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13341 SdHoareTripleChecker+Valid, 6272 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:31,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13341 Valid, 6272 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:58:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2024-10-11 04:58:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 2437. [2024-10-11 04:58:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2435 states have (on average 1.5634496919917864) internal successors, (3807), 2436 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states 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:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3807 transitions. [2024-10-11 04:58:31,281 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3807 transitions. Word has length 87 [2024-10-11 04:58:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:31,281 INFO L471 AbstractCegarLoop]: Abstraction has 2437 states and 3807 transitions. [2024-10-11 04:58:31,282 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:58:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3807 transitions. [2024-10-11 04:58:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:58:31,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:31,284 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:58:31,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:58:31,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:31,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1442819851, now seen corresponding path program 1 times [2024-10-11 04:58:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12562068] [2024-10-11 04:58:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:31,422 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:31,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12562068] [2024-10-11 04:58:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12562068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:31,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:31,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:31,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664873947] [2024-10-11 04:58:31,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:31,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:31,425 INFO L87 Difference]: Start difference. First operand 2437 states and 3807 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:58:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:31,476 INFO L93 Difference]: Finished difference Result 2658 states and 4166 transitions. [2024-10-11 04:58:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:31,477 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:58:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:31,489 INFO L225 Difference]: With dead ends: 2658 [2024-10-11 04:58:31,489 INFO L226 Difference]: Without dead ends: 2542 [2024-10-11 04:58:31,491 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:58:31,492 INFO L432 NwaCegarLoop]: 1595 mSDtfsCounter, 1504 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:31,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1685 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-10-11 04:58:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2540. [2024-10-11 04:58:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2538 states have (on average 1.5654058313632782) internal successors, (3973), 2539 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states 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:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3973 transitions. [2024-10-11 04:58:31,576 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3973 transitions. Word has length 89 [2024-10-11 04:58:31,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:31,576 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 3973 transitions. [2024-10-11 04:58:31,577 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:58:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3973 transitions. [2024-10-11 04:58:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:58:31,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:31,578 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:58:31,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:58:31,579 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:31,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1440674899, now seen corresponding path program 1 times [2024-10-11 04:58:31,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:31,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818837367] [2024-10-11 04:58:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:32,141 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:32,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818837367] [2024-10-11 04:58:32,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818837367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:32,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:32,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:58:32,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869521393] [2024-10-11 04:58:32,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:32,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:58:32,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:32,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:58:32,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:58:32,144 INFO L87 Difference]: Start difference. First operand 2540 states and 3973 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:58:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:32,615 INFO L93 Difference]: Finished difference Result 2761 states and 4329 transitions. [2024-10-11 04:58:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:58:32,616 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:58:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:32,625 INFO L225 Difference]: With dead ends: 2761 [2024-10-11 04:58:32,625 INFO L226 Difference]: Without dead ends: 2542 [2024-10-11 04:58:32,626 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:58:32,627 INFO L432 NwaCegarLoop]: 1587 mSDtfsCounter, 3092 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:32,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3092 Valid, 2243 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:58:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-10-11 04:58:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2540. [2024-10-11 04:58:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2538 states have (on average 1.5646178092986605) internal successors, (3971), 2539 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states 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:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3971 transitions. [2024-10-11 04:58:32,689 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3971 transitions. Word has length 89 [2024-10-11 04:58:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:32,690 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 3971 transitions. [2024-10-11 04:58:32,691 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:58:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3971 transitions. [2024-10-11 04:58:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 04:58:32,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:32,693 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:58:32,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:58:32,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:32,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1840151110, now seen corresponding path program 1 times [2024-10-11 04:58:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743440026] [2024-10-11 04:58:32,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:32,915 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:32,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743440026] [2024-10-11 04:58:32,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743440026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:32,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:32,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:58:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102824930] [2024-10-11 04:58:32,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:32,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:58:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:58:32,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:58:32,917 INFO L87 Difference]: Start difference. First operand 2540 states and 3971 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:58:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:32,960 INFO L93 Difference]: Finished difference Result 2546 states and 3978 transitions. [2024-10-11 04:58:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:58:32,961 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:58:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:32,969 INFO L225 Difference]: With dead ends: 2546 [2024-10-11 04:58:32,970 INFO L226 Difference]: Without dead ends: 2544 [2024-10-11 04:58:32,971 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:58:32,973 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 0 mSDsluCounter, 3184 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4780 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:58:32,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4780 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2024-10-11 04:58:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2024-10-11 04:58:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2542 states have (on average 1.5633359559402045) internal successors, (3974), 2543 states have internal predecessors, (3974), 0 states have call successors, (0), 0 states 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:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3974 transitions. [2024-10-11 04:58:33,032 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3974 transitions. Word has length 90 [2024-10-11 04:58:33,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:33,032 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 3974 transitions. [2024-10-11 04:58:33,033 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:58:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3974 transitions. [2024-10-11 04:58:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:58:33,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:33,034 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:58:33,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:58:33,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:33,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1591939181, now seen corresponding path program 1 times [2024-10-11 04:58:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949053344] [2024-10-11 04:58:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:58:33,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949053344] [2024-10-11 04:58:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949053344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:33,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:33,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347489528] [2024-10-11 04:58:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:33,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:33,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:33,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:33,135 INFO L87 Difference]: Start difference. First operand 2544 states and 3974 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:58:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:33,175 INFO L93 Difference]: Finished difference Result 2778 states and 4347 transitions. [2024-10-11 04:58:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:33,176 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:58:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:33,186 INFO L225 Difference]: With dead ends: 2778 [2024-10-11 04:58:33,186 INFO L226 Difference]: Without dead ends: 2658 [2024-10-11 04:58:33,188 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:58:33,189 INFO L432 NwaCegarLoop]: 1677 mSDtfsCounter, 1524 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1773 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:58:33,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1773 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-10-11 04:58:33,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2656. [2024-10-11 04:58:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2654 states have (on average 1.5640542577241898) internal successors, (4151), 2655 states have internal predecessors, (4151), 0 states have call successors, (0), 0 states 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:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 4151 transitions. [2024-10-11 04:58:33,251 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 4151 transitions. Word has length 91 [2024-10-11 04:58:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:33,251 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 4151 transitions. [2024-10-11 04:58:33,251 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:58:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 4151 transitions. [2024-10-11 04:58:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:58:33,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:33,252 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:58:33,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:58:33,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:33,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1666551661, now seen corresponding path program 1 times [2024-10-11 04:58:33,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:33,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15617543] [2024-10-11 04:58:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:33,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:33,350 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:33,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:33,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15617543] [2024-10-11 04:58:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15617543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:33,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:33,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:33,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866775374] [2024-10-11 04:58:33,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:33,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:33,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:33,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:33,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:33,354 INFO L87 Difference]: Start difference. First operand 2656 states and 4151 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:58:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:33,408 INFO L93 Difference]: Finished difference Result 3298 states and 5171 transitions. [2024-10-11 04:58:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:33,409 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:58:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:33,420 INFO L225 Difference]: With dead ends: 3298 [2024-10-11 04:58:33,420 INFO L226 Difference]: Without dead ends: 2965 [2024-10-11 04:58:33,423 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:58:33,425 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1522 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 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:58:33,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 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:58:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2024-10-11 04:58:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2024-10-11 04:58:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 2961 states have (on average 1.5646740965889903) internal successors, (4633), 2962 states have internal predecessors, (4633), 0 states have call successors, (0), 0 states 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:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4633 transitions. [2024-10-11 04:58:33,501 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4633 transitions. Word has length 91 [2024-10-11 04:58:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:33,502 INFO L471 AbstractCegarLoop]: Abstraction has 2963 states and 4633 transitions. [2024-10-11 04:58:33,502 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:58:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4633 transitions. [2024-10-11 04:58:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:58:33,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:33,503 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:58:33,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:58:33,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:33,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2011549037, now seen corresponding path program 1 times [2024-10-11 04:58:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913663630] [2024-10-11 04:58:33,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:33,625 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:33,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:33,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913663630] [2024-10-11 04:58:33,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913663630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:33,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:33,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:33,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547464845] [2024-10-11 04:58:33,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:33,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:33,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:33,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:33,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:33,627 INFO L87 Difference]: Start difference. First operand 2963 states and 4633 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:58:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:33,681 INFO L93 Difference]: Finished difference Result 4195 states and 6575 transitions. [2024-10-11 04:58:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:33,681 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:58:33,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:33,693 INFO L225 Difference]: With dead ends: 4195 [2024-10-11 04:58:33,694 INFO L226 Difference]: Without dead ends: 3555 [2024-10-11 04:58:33,696 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:58:33,696 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1518 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1775 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:58:33,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1775 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2024-10-11 04:58:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3553. [2024-10-11 04:58:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3551 states have (on average 1.5626584060827935) internal successors, (5549), 3552 states have internal predecessors, (5549), 0 states have call successors, (0), 0 states 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:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 5549 transitions. [2024-10-11 04:58:33,793 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 5549 transitions. Word has length 91 [2024-10-11 04:58:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:33,793 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 5549 transitions. [2024-10-11 04:58:33,793 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:58:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 5549 transitions. [2024-10-11 04:58:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:58:33,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:33,795 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:58:33,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:58:33,795 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1742965869, now seen corresponding path program 1 times [2024-10-11 04:58:33,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257148177] [2024-10-11 04:58:33,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:33,881 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:33,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257148177] [2024-10-11 04:58:33,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257148177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:33,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:33,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:33,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908391163] [2024-10-11 04:58:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:33,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:33,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:33,884 INFO L87 Difference]: Start difference. First operand 3553 states and 5549 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:58:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:33,958 INFO L93 Difference]: Finished difference Result 5917 states and 9239 transitions. [2024-10-11 04:58:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:33,959 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:58:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:33,973 INFO L225 Difference]: With dead ends: 5917 [2024-10-11 04:58:33,973 INFO L226 Difference]: Without dead ends: 4687 [2024-10-11 04:58:33,979 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:58:33,980 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 1516 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1777 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:58:33,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1777 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2024-10-11 04:58:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4685. [2024-10-11 04:58:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4685 states, 4683 states have (on average 1.5556267349989323) internal successors, (7285), 4684 states have internal predecessors, (7285), 0 states have call successors, (0), 0 states 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:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 7285 transitions. [2024-10-11 04:58:34,105 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 7285 transitions. Word has length 91 [2024-10-11 04:58:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:34,105 INFO L471 AbstractCegarLoop]: Abstraction has 4685 states and 7285 transitions. [2024-10-11 04:58:34,106 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:58:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 7285 transitions. [2024-10-11 04:58:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:58:34,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:34,107 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:58:34,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:58:34,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:34,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1782909805, now seen corresponding path program 1 times [2024-10-11 04:58:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:34,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714111795] [2024-10-11 04:58:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:34,189 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:34,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714111795] [2024-10-11 04:58:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714111795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:34,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:34,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737179512] [2024-10-11 04:58:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:34,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:34,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:34,191 INFO L87 Difference]: Start difference. First operand 4685 states and 7285 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:58:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:34,307 INFO L93 Difference]: Finished difference Result 9217 states and 14279 transitions. [2024-10-11 04:58:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:34,307 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:58:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:34,322 INFO L225 Difference]: With dead ends: 9217 [2024-10-11 04:58:34,323 INFO L226 Difference]: Without dead ends: 6855 [2024-10-11 04:58:34,328 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:58:34,329 INFO L432 NwaCegarLoop]: 1663 mSDtfsCounter, 1514 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 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:58:34,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 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:58:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6855 states. [2024-10-11 04:58:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6855 to 6853. [2024-10-11 04:58:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6853 states, 6851 states have (on average 1.5421106407823675) internal successors, (10565), 6852 states have internal predecessors, (10565), 0 states have call successors, (0), 0 states 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:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 10565 transitions. [2024-10-11 04:58:34,515 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 10565 transitions. Word has length 91 [2024-10-11 04:58:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:34,515 INFO L471 AbstractCegarLoop]: Abstraction has 6853 states and 10565 transitions. [2024-10-11 04:58:34,515 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:58:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 10565 transitions. [2024-10-11 04:58:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:58:34,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:34,517 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:58:34,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:58:34,517 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:34,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1157253741, now seen corresponding path program 1 times [2024-10-11 04:58:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:34,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900250958] [2024-10-11 04:58:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:34,599 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:34,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:34,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900250958] [2024-10-11 04:58:34,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900250958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:34,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:34,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:34,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157618108] [2024-10-11 04:58:34,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:34,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:34,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:34,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:34,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:34,602 INFO L87 Difference]: Start difference. First operand 6853 states and 10565 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:58:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:34,863 INFO L93 Difference]: Finished difference Result 15529 states and 23783 transitions. [2024-10-11 04:58:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:34,863 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:58:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:34,884 INFO L225 Difference]: With dead ends: 15529 [2024-10-11 04:58:34,884 INFO L226 Difference]: Without dead ends: 10999 [2024-10-11 04:58:34,892 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:58:34,893 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 1512 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1781 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:58:34,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1781 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10999 states. [2024-10-11 04:58:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10999 to 10997. [2024-10-11 04:58:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10997 states, 10995 states have (on average 1.5226011823556163) internal successors, (16741), 10996 states have internal predecessors, (16741), 0 states have call successors, (0), 0 states 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:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10997 states to 10997 states and 16741 transitions. [2024-10-11 04:58:35,206 INFO L78 Accepts]: Start accepts. Automaton has 10997 states and 16741 transitions. Word has length 91 [2024-10-11 04:58:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:35,207 INFO L471 AbstractCegarLoop]: Abstraction has 10997 states and 16741 transitions. [2024-10-11 04:58:35,207 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:58:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 10997 states and 16741 transitions. [2024-10-11 04:58:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:58:35,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:35,208 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:58:35,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:58:35,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:35,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2045987181, now seen corresponding path program 1 times [2024-10-11 04:58:35,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956928857] [2024-10-11 04:58:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:35,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:35,295 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:35,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956928857] [2024-10-11 04:58:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956928857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:35,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:35,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146927798] [2024-10-11 04:58:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:35,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:35,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:35,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:35,297 INFO L87 Difference]: Start difference. First operand 10997 states and 16741 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:58:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:35,653 INFO L93 Difference]: Finished difference Result 27577 states and 41639 transitions. [2024-10-11 04:58:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:35,654 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:58:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:35,695 INFO L225 Difference]: With dead ends: 27577 [2024-10-11 04:58:35,696 INFO L226 Difference]: Without dead ends: 18903 [2024-10-11 04:58:35,714 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:58:35,715 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 1510 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1783 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:58:35,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2024-10-11 04:58:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 18901. [2024-10-11 04:58:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18901 states, 18899 states have (on average 1.4987565479655007) internal successors, (28325), 18900 states have internal predecessors, (28325), 0 states have call successors, (0), 0 states 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:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18901 states to 18901 states and 28325 transitions. [2024-10-11 04:58:36,554 INFO L78 Accepts]: Start accepts. Automaton has 18901 states and 28325 transitions. Word has length 91 [2024-10-11 04:58:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:36,555 INFO L471 AbstractCegarLoop]: Abstraction has 18901 states and 28325 transitions. [2024-10-11 04:58:36,555 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:58:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18901 states and 28325 transitions. [2024-10-11 04:58:36,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:58:36,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:36,557 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:58:36,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:58:36,557 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:36,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1873031571, now seen corresponding path program 1 times [2024-10-11 04:58:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:36,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472759046] [2024-10-11 04:58:36,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:36,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:36,663 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:36,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:36,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472759046] [2024-10-11 04:58:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472759046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:36,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:36,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:58:36,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601816317] [2024-10-11 04:58:36,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:36,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:58:36,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:58:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:58:36,666 INFO L87 Difference]: Start difference. First operand 18901 states and 28325 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:58:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:37,420 INFO L93 Difference]: Finished difference Result 50521 states and 75047 transitions. [2024-10-11 04:58:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:58:37,421 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:58:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:37,496 INFO L225 Difference]: With dead ends: 50521 [2024-10-11 04:58:37,497 INFO L226 Difference]: Without dead ends: 33943 [2024-10-11 04:58:37,533 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:58:37,535 INFO L432 NwaCegarLoop]: 1677 mSDtfsCounter, 1520 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1781 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:58:37,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1781 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:58:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33943 states. [2024-10-11 04:58:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33943 to 33941. [2024-10-11 04:58:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33941 states, 33939 states have (on average 1.471964406729721) internal successors, (49957), 33940 states have internal predecessors, (49957), 0 states have call successors, (0), 0 states 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:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33941 states to 33941 states and 49957 transitions. [2024-10-11 04:58:38,739 INFO L78 Accepts]: Start accepts. Automaton has 33941 states and 49957 transitions. Word has length 91 [2024-10-11 04:58:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:38,740 INFO L471 AbstractCegarLoop]: Abstraction has 33941 states and 49957 transitions. [2024-10-11 04:58:38,740 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:58:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33941 states and 49957 transitions. [2024-10-11 04:58:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:58:38,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:38,748 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:58:38,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:58:38,749 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:38,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1900714775, now seen corresponding path program 1 times [2024-10-11 04:58:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:38,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256726760] [2024-10-11 04:58:38,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:38,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:58:39,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:39,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256726760] [2024-10-11 04:58:39,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256726760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:39,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:58:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859855525] [2024-10-11 04:58:39,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:39,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:58:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:39,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:58:39,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:58:39,198 INFO L87 Difference]: Start difference. First operand 33941 states and 49957 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:44,382 INFO L93 Difference]: Finished difference Result 283559 states and 415662 transitions. [2024-10-11 04:58:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:58:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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:58:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:45,254 INFO L225 Difference]: With dead ends: 283559 [2024-10-11 04:58:45,254 INFO L226 Difference]: Without dead ends: 261541 [2024-10-11 04:58:45,330 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:58:45,331 INFO L432 NwaCegarLoop]: 1693 mSDtfsCounter, 11678 mSDsluCounter, 3531 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11678 SdHoareTripleChecker+Valid, 5224 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:45,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11678 Valid, 5224 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:58:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261541 states. [2024-10-11 04:58:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261541 to 60821. [2024-10-11 04:58:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60821 states, 60819 states have (on average 1.4633091632549038) internal successors, (88997), 60820 states have internal predecessors, (88997), 0 states have call successors, (0), 0 states 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:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60821 states to 60821 states and 88997 transitions. [2024-10-11 04:58:49,083 INFO L78 Accepts]: Start accepts. Automaton has 60821 states and 88997 transitions. Word has length 115 [2024-10-11 04:58:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:49,083 INFO L471 AbstractCegarLoop]: Abstraction has 60821 states and 88997 transitions. [2024-10-11 04:58:49,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 60821 states and 88997 transitions. [2024-10-11 04:58:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:58:49,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:49,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:58:49,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:58:49,094 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:49,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1975327255, now seen corresponding path program 1 times [2024-10-11 04:58:49,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:49,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240550998] [2024-10-11 04:58:49,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:49,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:49,585 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:58:49,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:49,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240550998] [2024-10-11 04:58:49,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240550998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:49,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:49,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:58:49,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772557673] [2024-10-11 04:58:49,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:49,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:58:49,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:49,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:58:49,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:58:49,589 INFO L87 Difference]: Start difference. First operand 60821 states and 88997 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:58:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:56,524 INFO L93 Difference]: Finished difference Result 315175 states and 461742 transitions. [2024-10-11 04:58:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:58:56,526 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:58:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:57,195 INFO L225 Difference]: With dead ends: 315175 [2024-10-11 04:58:57,196 INFO L226 Difference]: Without dead ends: 283557 [2024-10-11 04:58:57,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:58:57,284 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 11680 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11680 SdHoareTripleChecker+Valid, 5181 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:57,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11680 Valid, 5181 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:58:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283557 states. [2024-10-11 04:59:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283557 to 103445. [2024-10-11 04:59:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103445 states, 103443 states have (on average 1.458010691878619) internal successors, (150821), 103444 states have internal predecessors, (150821), 0 states have call successors, (0), 0 states 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,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103445 states to 103445 states and 150821 transitions. [2024-10-11 04:59:02,551 INFO L78 Accepts]: Start accepts. Automaton has 103445 states and 150821 transitions. Word has length 115 [2024-10-11 04:59:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:59:02,552 INFO L471 AbstractCegarLoop]: Abstraction has 103445 states and 150821 transitions. [2024-10-11 04:59:02,552 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:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 103445 states and 150821 transitions. [2024-10-11 04:59:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:59:02,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:59:02,564 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:02,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:59:02,564 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:59:02,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:59:02,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1974642665, now seen corresponding path program 1 times [2024-10-11 04:59:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:59:02,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705276504] [2024-10-11 04:59:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:59:02,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:59:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:59:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:59:02,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:59:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705276504] [2024-10-11 04:59:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705276504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:59:02,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:59:02,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:59:02,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350767007] [2024-10-11 04:59:02,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:59:02,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:59:02,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:59:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:59:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:59:02,854 INFO L87 Difference]: Start difference. First operand 103445 states and 150821 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:59:10,995 INFO L93 Difference]: Finished difference Result 346791 states and 507694 transitions. [2024-10-11 04:59:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:59:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:59:11,811 INFO L225 Difference]: With dead ends: 346791 [2024-10-11 04:59:11,811 INFO L226 Difference]: Without dead ends: 315173 [2024-10-11 04:59:11,906 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:11,907 INFO L432 NwaCegarLoop]: 1690 mSDtfsCounter, 11722 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11722 SdHoareTripleChecker+Valid, 5175 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:59:11,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11722 Valid, 5175 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:59:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315173 states.