./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.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/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.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 a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:20:25,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:20:26,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:20:26,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:20:26,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:20:26,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:20:26,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:20:26,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:20:26,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:20:26,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:20:26,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:20:26,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:20:26,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:20:26,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:20:26,023 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:20:26,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:20:26,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:20:26,024 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:20:26,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:20:26,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:20:26,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:20:26,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:20:26,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:20:26,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:20:26,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:20:26,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:20:26,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:20:26,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:20:26,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:20:26,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:20:26,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:20:26,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:20:26,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:20:26,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:20:26,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:20:26,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:20:26,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:20:26,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:20:26,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:20:26,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:20:26,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:20:26,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:20:26,033 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 -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2024-10-11 03:20:26,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:20:26,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:20:26,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:20:26,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:20:26,308 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:20:26,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-10-11 03:20:27,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:20:27,890 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:20:27,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-10-11 03:20:27,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ce8768de/102f8818c7214b92b12168be594fed62/FLAGc3bcc04ee [2024-10-11 03:20:27,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ce8768de/102f8818c7214b92b12168be594fed62 [2024-10-11 03:20:27,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:20:27,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:20:27,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:20:27,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:20:27,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:20:27,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:20:27" (1/1) ... [2024-10-11 03:20:27,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4749e62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:27, skipping insertion in model container [2024-10-11 03:20:27,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:20:27" (1/1) ... [2024-10-11 03:20:27,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:20:28,149 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-10-11 03:20:28,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:20:28,167 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:20:28,196 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-10-11 03:20:28,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:20:28,210 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:20:28,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28 WrapperNode [2024-10-11 03:20:28,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:20:28,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:20:28,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:20:28,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:20:28,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,260 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2024-10-11 03:20:28,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:20:28,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:20:28,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:20:28,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:20:28,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,290 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 03:20:28,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:20:28,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:20:28,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:20:28,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:20:28,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (1/1) ... [2024-10-11 03:20:28,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:20:28,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:20:28,356 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 03:20:28,359 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 03:20:28,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:20:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:20:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:20:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:20:28,481 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:20:28,483 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:20:28,786 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 03:20:28,786 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:20:28,816 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:20:28,816 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:20:28,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:20:28 BoogieIcfgContainer [2024-10-11 03:20:28,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:20:28,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:20:28,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:20:28,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:20:28,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:20:27" (1/3) ... [2024-10-11 03:20:28,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e55382f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:20:28, skipping insertion in model container [2024-10-11 03:20:28,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:28" (2/3) ... [2024-10-11 03:20:28,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e55382f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:20:28, skipping insertion in model container [2024-10-11 03:20:28,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:20:28" (3/3) ... [2024-10-11 03:20:28,824 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-10-11 03:20:28,837 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:20:28,837 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:20:28,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:20:28,906 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;@4c565c69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:20:28,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:20:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 03:20:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 03:20:28,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:28,925 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] [2024-10-11 03:20:28,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:28,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1331125770, now seen corresponding path program 1 times [2024-10-11 03:20:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:28,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841036377] [2024-10-11 03:20:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:28,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:29,320 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 03:20:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:29,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841036377] [2024-10-11 03:20:29,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841036377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:29,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:29,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:29,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329887316] [2024-10-11 03:20:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:29,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:29,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:29,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:29,350 INFO L87 Difference]: Start difference. First operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 0 states have call successors, (0), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 03:20:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:29,514 INFO L93 Difference]: Finished difference Result 142 states and 237 transitions. [2024-10-11 03:20:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-11 03:20:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:29,525 INFO L225 Difference]: With dead ends: 142 [2024-10-11 03:20:29,525 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 03:20:29,528 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 03:20:29,530 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:29,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 264 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 03:20:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 59. [2024-10-11 03:20:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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 03:20:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2024-10-11 03:20:29,569 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 22 [2024-10-11 03:20:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:29,569 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2024-10-11 03:20:29,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 03:20:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2024-10-11 03:20:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 03:20:29,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:29,571 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] [2024-10-11 03:20:29,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:20:29,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:29,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash 855144128, now seen corresponding path program 1 times [2024-10-11 03:20:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:29,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583140597] [2024-10-11 03:20:29,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:29,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:29,691 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 03:20:29,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:29,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583140597] [2024-10-11 03:20:29,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583140597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:29,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:29,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903397764] [2024-10-11 03:20:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:29,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:29,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:29,695 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 03:20:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:29,743 INFO L93 Difference]: Finished difference Result 127 states and 190 transitions. [2024-10-11 03:20:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:29,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-11 03:20:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:29,746 INFO L225 Difference]: With dead ends: 127 [2024-10-11 03:20:29,746 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 03:20:29,746 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 03:20:29,748 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 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 03:20:29,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 03:20:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-10-11 03:20:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 86 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 03:20:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2024-10-11 03:20:29,767 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 38 [2024-10-11 03:20:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:29,768 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2024-10-11 03:20:29,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 03:20:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2024-10-11 03:20:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 03:20:29,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:29,772 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] [2024-10-11 03:20:29,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:20:29,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:29,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1766348127, now seen corresponding path program 1 times [2024-10-11 03:20:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395823598] [2024-10-11 03:20:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:29,864 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 03:20:29,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:29,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395823598] [2024-10-11 03:20:29,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395823598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:29,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:29,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:29,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258178827] [2024-10-11 03:20:29,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:29,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:29,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:29,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:29,870 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 03:20:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:29,896 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-10-11 03:20:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:29,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-11 03:20:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:29,898 INFO L225 Difference]: With dead ends: 203 [2024-10-11 03:20:29,899 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 03:20:29,899 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 03:20:29,900 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 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 03:20:29,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 03:20:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-10-11 03:20:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.507462686567164) internal successors, (202), 134 states have internal predecessors, (202), 0 states have call successors, (0), 0 states 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 03:20:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-11 03:20:29,912 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 38 [2024-10-11 03:20:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:29,913 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-11 03:20:29,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 03:20:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-11 03:20:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 03:20:29,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:29,914 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] [2024-10-11 03:20:29,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:20:29,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:29,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2141824130, now seen corresponding path program 1 times [2024-10-11 03:20:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:29,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142478656] [2024-10-11 03:20:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142478656] [2024-10-11 03:20:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142478656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:30,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:20:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926938144] [2024-10-11 03:20:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:30,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:20:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:20:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:20:30,069 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 03:20:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:30,174 INFO L93 Difference]: Finished difference Result 591 states and 926 transitions. [2024-10-11 03:20:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:20:30,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-11 03:20:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:30,181 INFO L225 Difference]: With dead ends: 591 [2024-10-11 03:20:30,185 INFO L226 Difference]: Without dead ends: 477 [2024-10-11 03:20:30,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:20:30,187 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 308 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:30,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 409 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-11 03:20:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 247. [2024-10-11 03:20:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.5203252032520325) internal successors, (374), 246 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 03:20:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 374 transitions. [2024-10-11 03:20:30,215 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 374 transitions. Word has length 38 [2024-10-11 03:20:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:30,215 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 374 transitions. [2024-10-11 03:20:30,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 03:20:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 374 transitions. [2024-10-11 03:20:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 03:20:30,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:30,220 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] [2024-10-11 03:20:30,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:20:30,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:30,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:30,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1985069537, now seen corresponding path program 1 times [2024-10-11 03:20:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:30,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556318208] [2024-10-11 03:20:30,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:30,399 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 03:20:30,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:30,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556318208] [2024-10-11 03:20:30,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556318208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:30,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:30,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:30,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608186358] [2024-10-11 03:20:30,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:30,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:30,401 INFO L87 Difference]: Start difference. First operand 247 states and 374 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 03:20:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:30,431 INFO L93 Difference]: Finished difference Result 265 states and 399 transitions. [2024-10-11 03:20:30,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:30,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-11 03:20:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:30,434 INFO L225 Difference]: With dead ends: 265 [2024-10-11 03:20:30,434 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 03:20:30,434 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 03:20:30,436 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:30,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 03:20:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-10-11 03:20:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4885496183206106) internal successors, (390), 262 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 03:20:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2024-10-11 03:20:30,455 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 39 [2024-10-11 03:20:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:30,455 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2024-10-11 03:20:30,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 03:20:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2024-10-11 03:20:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 03:20:30,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:30,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:30,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:20:30,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:30,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1406583098, now seen corresponding path program 1 times [2024-10-11 03:20:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:30,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20469576] [2024-10-11 03:20:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:30,515 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 03:20:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20469576] [2024-10-11 03:20:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20469576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:30,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702802133] [2024-10-11 03:20:30,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:30,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:30,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:30,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:30,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:30,517 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 03:20:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:30,541 INFO L93 Difference]: Finished difference Result 691 states and 1032 transitions. [2024-10-11 03:20:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:30,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-11 03:20:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:30,545 INFO L225 Difference]: With dead ends: 691 [2024-10-11 03:20:30,545 INFO L226 Difference]: Without dead ends: 449 [2024-10-11 03:20:30,546 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 03:20:30,546 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:30,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-11 03:20:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-11 03:20:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.4663677130044843) internal successors, (654), 446 states have internal predecessors, (654), 0 states have call successors, (0), 0 states 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 03:20:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 654 transitions. [2024-10-11 03:20:30,568 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 654 transitions. Word has length 40 [2024-10-11 03:20:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:30,568 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 654 transitions. [2024-10-11 03:20:30,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 03:20:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 654 transitions. [2024-10-11 03:20:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 03:20:30,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:30,569 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] [2024-10-11 03:20:30,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:20:30,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:30,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1835898686, now seen corresponding path program 1 times [2024-10-11 03:20:30,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:30,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382680638] [2024-10-11 03:20:30,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:30,611 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 03:20:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382680638] [2024-10-11 03:20:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382680638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:30,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672559821] [2024-10-11 03:20:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:30,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:30,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:30,613 INFO L87 Difference]: Start difference. First operand 447 states and 654 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 03:20:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:30,638 INFO L93 Difference]: Finished difference Result 877 states and 1299 transitions. [2024-10-11 03:20:30,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:30,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-11 03:20:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:30,641 INFO L225 Difference]: With dead ends: 877 [2024-10-11 03:20:30,641 INFO L226 Difference]: Without dead ends: 635 [2024-10-11 03:20:30,641 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 03:20:30,642 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 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 03:20:30,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-11 03:20:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2024-10-11 03:20:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4556962025316456) internal successors, (920), 632 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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 03:20:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 920 transitions. [2024-10-11 03:20:30,658 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 920 transitions. Word has length 40 [2024-10-11 03:20:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:30,658 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 920 transitions. [2024-10-11 03:20:30,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 03:20:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 920 transitions. [2024-10-11 03:20:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:20:30,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:30,660 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:20:30,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:20:30,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:30,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1126850639, now seen corresponding path program 1 times [2024-10-11 03:20:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803276377] [2024-10-11 03:20:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:20:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:30,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803276377] [2024-10-11 03:20:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803276377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:20:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044398733] [2024-10-11 03:20:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:30,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:30,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:20:30,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:20:30,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:20:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:30,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 03:20:30,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:20:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:31,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:20:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:32,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044398733] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:20:32,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:20:32,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 15 [2024-10-11 03:20:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052343104] [2024-10-11 03:20:32,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:20:32,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 03:20:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:32,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 03:20:32,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:20:32,085 INFO L87 Difference]: Start difference. First operand 633 states and 920 transitions. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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 03:20:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:32,862 INFO L93 Difference]: Finished difference Result 2723 states and 3940 transitions. [2024-10-11 03:20:32,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:20:32,862 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 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 58 [2024-10-11 03:20:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:32,870 INFO L225 Difference]: With dead ends: 2723 [2024-10-11 03:20:32,870 INFO L226 Difference]: Without dead ends: 2113 [2024-10-11 03:20:32,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=432, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:20:32,873 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1451 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:32,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 578 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:20:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2024-10-11 03:20:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1497. [2024-10-11 03:20:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1496 states have (on average 1.4418449197860963) internal successors, (2157), 1496 states have internal predecessors, (2157), 0 states have call successors, (0), 0 states 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 03:20:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2157 transitions. [2024-10-11 03:20:32,935 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2157 transitions. Word has length 58 [2024-10-11 03:20:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:32,936 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 2157 transitions. [2024-10-11 03:20:32,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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 03:20:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2157 transitions. [2024-10-11 03:20:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:20:32,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:32,938 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:32,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:20:33,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:33,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:33,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:33,141 INFO L85 PathProgramCache]: Analyzing trace with hash 741118013, now seen corresponding path program 1 times [2024-10-11 03:20:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:33,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808711198] [2024-10-11 03:20:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:33,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:20:33,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:33,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808711198] [2024-10-11 03:20:33,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808711198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:33,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:33,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:20:33,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194116020] [2024-10-11 03:20:33,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:33,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:20:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:33,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:20:33,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:20:33,261 INFO L87 Difference]: Start difference. First operand 1497 states and 2157 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 03:20:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:33,363 INFO L93 Difference]: Finished difference Result 3717 states and 5413 transitions. [2024-10-11 03:20:33,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:20:33,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 03:20:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:33,374 INFO L225 Difference]: With dead ends: 3717 [2024-10-11 03:20:33,375 INFO L226 Difference]: Without dead ends: 2967 [2024-10-11 03:20:33,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:20:33,378 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 206 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:33,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 380 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2024-10-11 03:20:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2213. [2024-10-11 03:20:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2212 states have (on average 1.43625678119349) internal successors, (3177), 2212 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states 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 03:20:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3177 transitions. [2024-10-11 03:20:33,485 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3177 transitions. Word has length 59 [2024-10-11 03:20:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:33,486 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 3177 transitions. [2024-10-11 03:20:33,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 03:20:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3177 transitions. [2024-10-11 03:20:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:20:33,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:33,487 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:33,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:20:33,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:33,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:33,489 INFO L85 PathProgramCache]: Analyzing trace with hash 776858752, now seen corresponding path program 1 times [2024-10-11 03:20:33,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:33,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920522881] [2024-10-11 03:20:33,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:20:33,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920522881] [2024-10-11 03:20:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920522881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:33,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:20:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171295026] [2024-10-11 03:20:33,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:33,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:20:33,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:33,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:20:33,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:20:33,561 INFO L87 Difference]: Start difference. First operand 2213 states and 3177 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 03:20:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:33,676 INFO L93 Difference]: Finished difference Result 4433 states and 6433 transitions. [2024-10-11 03:20:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:20:33,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 03:20:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:33,688 INFO L225 Difference]: With dead ends: 4433 [2024-10-11 03:20:33,688 INFO L226 Difference]: Without dead ends: 3683 [2024-10-11 03:20:33,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:20:33,691 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 207 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:33,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 362 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2024-10-11 03:20:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 2929. [2024-10-11 03:20:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2928 states have (on average 1.4334016393442623) internal successors, (4197), 2928 states have internal predecessors, (4197), 0 states have call successors, (0), 0 states 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 03:20:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 4197 transitions. [2024-10-11 03:20:33,807 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 4197 transitions. Word has length 59 [2024-10-11 03:20:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:33,807 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 4197 transitions. [2024-10-11 03:20:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 03:20:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 4197 transitions. [2024-10-11 03:20:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:20:33,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:33,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:33,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:20:33,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:33,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:33,809 INFO L85 PathProgramCache]: Analyzing trace with hash 152359038, now seen corresponding path program 1 times [2024-10-11 03:20:33,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:33,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823424565] [2024-10-11 03:20:33,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:33,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:20:33,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:33,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823424565] [2024-10-11 03:20:33,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823424565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:33,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:33,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:20:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076794911] [2024-10-11 03:20:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:33,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:20:33,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:33,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:20:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:20:33,885 INFO L87 Difference]: Start difference. First operand 2929 states and 4197 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 03:20:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:34,003 INFO L93 Difference]: Finished difference Result 5149 states and 7453 transitions. [2024-10-11 03:20:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:20:34,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 03:20:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:34,017 INFO L225 Difference]: With dead ends: 5149 [2024-10-11 03:20:34,017 INFO L226 Difference]: Without dead ends: 4399 [2024-10-11 03:20:34,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:20:34,020 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 213 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:34,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 382 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4399 states. [2024-10-11 03:20:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4399 to 3645. [2024-10-11 03:20:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3645 states, 3644 states have (on average 1.4316684961580681) internal successors, (5217), 3644 states have internal predecessors, (5217), 0 states have call successors, (0), 0 states 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 03:20:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 5217 transitions. [2024-10-11 03:20:34,163 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 5217 transitions. Word has length 59 [2024-10-11 03:20:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:34,163 INFO L471 AbstractCegarLoop]: Abstraction has 3645 states and 5217 transitions. [2024-10-11 03:20:34,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 03:20:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 5217 transitions. [2024-10-11 03:20:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:20:34,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:34,164 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:34,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:20:34,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:34,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:34,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1181811766, now seen corresponding path program 1 times [2024-10-11 03:20:34,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835523768] [2024-10-11 03:20:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:34,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:34,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835523768] [2024-10-11 03:20:34,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835523768] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:20:34,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913078014] [2024-10-11 03:20:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:34,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:34,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:20:34,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:20:34,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:20:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:34,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 03:20:34,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:20:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:35,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:20:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:36,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913078014] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:20:36,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:20:36,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-11 03:20:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827042841] [2024-10-11 03:20:36,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:20:36,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 03:20:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:36,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 03:20:36,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:20:36,483 INFO L87 Difference]: Start difference. First operand 3645 states and 5217 transitions. Second operand has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 28 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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 03:20:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:48,588 INFO L93 Difference]: Finished difference Result 54213 states and 77141 transitions. [2024-10-11 03:20:48,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-10-11 03:20:48,589 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 28 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 03:20:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:48,786 INFO L225 Difference]: With dead ends: 54213 [2024-10-11 03:20:48,787 INFO L226 Difference]: Without dead ends: 50602 [2024-10-11 03:20:48,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14715 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=5459, Invalid=29697, Unknown=0, NotChecked=0, Total=35156 [2024-10-11 03:20:48,811 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 4453 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:48,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4453 Valid, 2003 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 03:20:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50602 states. [2024-10-11 03:20:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50602 to 19942. [2024-10-11 03:20:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19942 states, 19941 states have (on average 1.3984755027330624) internal successors, (27887), 19941 states have internal predecessors, (27887), 0 states have call successors, (0), 0 states 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 03:20:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19942 states to 19942 states and 27887 transitions. [2024-10-11 03:20:50,093 INFO L78 Accepts]: Start accepts. Automaton has 19942 states and 27887 transitions. Word has length 62 [2024-10-11 03:20:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:50,094 INFO L471 AbstractCegarLoop]: Abstraction has 19942 states and 27887 transitions. [2024-10-11 03:20:50,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 28 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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 03:20:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 19942 states and 27887 transitions. [2024-10-11 03:20:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:20:50,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:50,095 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:50,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:20:50,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:50,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:50,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1207652568, now seen corresponding path program 1 times [2024-10-11 03:20:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:50,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310155511] [2024-10-11 03:20:50,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:50,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310155511] [2024-10-11 03:20:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310155511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793917428] [2024-10-11 03:20:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:50,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:50,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:50,342 INFO L87 Difference]: Start difference. First operand 19942 states and 27887 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 03:20:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:51,283 INFO L93 Difference]: Finished difference Result 51820 states and 72359 transitions. [2024-10-11 03:20:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:51,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-11 03:20:51,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:51,344 INFO L225 Difference]: With dead ends: 51820 [2024-10-11 03:20:51,344 INFO L226 Difference]: Without dead ends: 32019 [2024-10-11 03:20:51,363 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 03:20:51,366 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:51,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 183 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32019 states. [2024-10-11 03:20:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32019 to 31921. [2024-10-11 03:20:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31921 states, 31920 states have (on average 1.375219298245614) internal successors, (43897), 31920 states have internal predecessors, (43897), 0 states have call successors, (0), 0 states 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 03:20:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31921 states to 31921 states and 43897 transitions. [2024-10-11 03:20:52,768 INFO L78 Accepts]: Start accepts. Automaton has 31921 states and 43897 transitions. Word has length 63 [2024-10-11 03:20:52,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:52,769 INFO L471 AbstractCegarLoop]: Abstraction has 31921 states and 43897 transitions. [2024-10-11 03:20:52,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 03:20:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31921 states and 43897 transitions. [2024-10-11 03:20:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:20:52,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:52,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:52,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:20:52,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:52,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash 933777477, now seen corresponding path program 1 times [2024-10-11 03:20:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271243896] [2024-10-11 03:20:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:52,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:52,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271243896] [2024-10-11 03:20:52,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271243896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:52,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:52,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:52,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000020324] [2024-10-11 03:20:52,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:52,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:52,825 INFO L87 Difference]: Start difference. First operand 31921 states and 43897 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 03:20:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:54,783 INFO L93 Difference]: Finished difference Result 91844 states and 126076 transitions. [2024-10-11 03:20:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:54,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-11 03:20:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:54,902 INFO L225 Difference]: With dead ends: 91844 [2024-10-11 03:20:54,902 INFO L226 Difference]: Without dead ends: 60014 [2024-10-11 03:20:54,932 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 03:20:54,933 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:54,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60014 states. [2024-10-11 03:20:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60014 to 60012. [2024-10-11 03:20:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60012 states, 60011 states have (on average 1.3530519404775792) internal successors, (81198), 60011 states have internal predecessors, (81198), 0 states have call successors, (0), 0 states 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 03:20:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60012 states to 60012 states and 81198 transitions. [2024-10-11 03:20:57,683 INFO L78 Accepts]: Start accepts. Automaton has 60012 states and 81198 transitions. Word has length 63 [2024-10-11 03:20:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:57,684 INFO L471 AbstractCegarLoop]: Abstraction has 60012 states and 81198 transitions. [2024-10-11 03:20:57,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 03:20:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 60012 states and 81198 transitions. [2024-10-11 03:20:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:20:57,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:57,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:57,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:20:57,687 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:57,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash -438029821, now seen corresponding path program 1 times [2024-10-11 03:20:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:57,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246587874] [2024-10-11 03:20:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246587874] [2024-10-11 03:20:57,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246587874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:20:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609919383] [2024-10-11 03:20:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:57,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:57,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:20:57,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:20:57,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:20:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:57,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:20:57,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:20:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:57,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:20:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:58,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609919383] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:20:58,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:20:58,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 03:20:58,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68151775] [2024-10-11 03:20:58,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:20:58,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:20:58,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:20:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:20:58,048 INFO L87 Difference]: Start difference. First operand 60012 states and 81198 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:00,247 INFO L93 Difference]: Finished difference Result 114399 states and 154990 transitions. [2024-10-11 03:21:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:21:00,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 03:21:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:00,338 INFO L225 Difference]: With dead ends: 114399 [2024-10-11 03:21:00,339 INFO L226 Difference]: Without dead ends: 54773 [2024-10-11 03:21:00,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:21:00,373 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 511 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:00,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 327 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54773 states. [2024-10-11 03:21:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54773 to 48106. [2024-10-11 03:21:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48106 states, 48105 states have (on average 1.3326889096767487) internal successors, (64109), 48105 states have internal predecessors, (64109), 0 states have call successors, (0), 0 states 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 03:21:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48106 states to 48106 states and 64109 transitions. [2024-10-11 03:21:02,718 INFO L78 Accepts]: Start accepts. Automaton has 48106 states and 64109 transitions. Word has length 63 [2024-10-11 03:21:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:02,719 INFO L471 AbstractCegarLoop]: Abstraction has 48106 states and 64109 transitions. [2024-10-11 03:21:02,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 48106 states and 64109 transitions. [2024-10-11 03:21:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:21:02,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:02,722 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:02,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:21:02,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:21:02,923 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:02,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1979108011, now seen corresponding path program 1 times [2024-10-11 03:21:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109688424] [2024-10-11 03:21:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109688424] [2024-10-11 03:21:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109688424] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:21:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293923480] [2024-10-11 03:21:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:21:03,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:03,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:21:03,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:21:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:03,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 03:21:03,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:21:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:04,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:21:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:06,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293923480] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:21:06,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:21:06,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 34 [2024-10-11 03:21:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495683497] [2024-10-11 03:21:06,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:21:06,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 03:21:06,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:06,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 03:21:06,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:21:06,276 INFO L87 Difference]: Start difference. First operand 48106 states and 64109 transitions. Second operand has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 34 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 03:21:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:19,103 INFO L93 Difference]: Finished difference Result 286013 states and 379874 transitions. [2024-10-11 03:21:19,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-10-11 03:21:19,107 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 34 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 03:21:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:19,662 INFO L225 Difference]: With dead ends: 286013 [2024-10-11 03:21:19,662 INFO L226 Difference]: Without dead ends: 252775 [2024-10-11 03:21:19,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4248 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2450, Invalid=10660, Unknown=0, NotChecked=0, Total=13110 [2024-10-11 03:21:19,702 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 3711 mSDsluCounter, 3902 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3711 SdHoareTripleChecker+Valid, 4013 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:19,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3711 Valid, 4013 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:21:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252775 states. [2024-10-11 03:21:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252775 to 72956. [2024-10-11 03:21:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72956 states, 72955 states have (on average 1.3285724076485506) internal successors, (96926), 72955 states have internal predecessors, (96926), 0 states have call successors, (0), 0 states 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 03:21:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72956 states to 72956 states and 96926 transitions. [2024-10-11 03:21:24,016 INFO L78 Accepts]: Start accepts. Automaton has 72956 states and 96926 transitions. Word has length 64 [2024-10-11 03:21:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:24,016 INFO L471 AbstractCegarLoop]: Abstraction has 72956 states and 96926 transitions. [2024-10-11 03:21:24,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 34 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 03:21:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 72956 states and 96926 transitions. [2024-10-11 03:21:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:21:24,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:24,053 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 03:21:24,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:21:24,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 03:21:24,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:24,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash -619816017, now seen corresponding path program 1 times [2024-10-11 03:21:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:24,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227910217] [2024-10-11 03:21:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 03:21:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:24,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227910217] [2024-10-11 03:21:24,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227910217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:24,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:24,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:24,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081590429] [2024-10-11 03:21:24,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:24,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:24,307 INFO L87 Difference]: Start difference. First operand 72956 states and 96926 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:26,776 INFO L93 Difference]: Finished difference Result 127918 states and 169978 transitions. [2024-10-11 03:21:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:26,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:21:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:26,870 INFO L225 Difference]: With dead ends: 127918 [2024-10-11 03:21:26,871 INFO L226 Difference]: Without dead ends: 71740 [2024-10-11 03:21:26,902 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 03:21:26,902 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 27 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:26,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 189 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71740 states. [2024-10-11 03:21:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71740 to 66724. [2024-10-11 03:21:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66724 states, 66723 states have (on average 1.3218830088575153) internal successors, (88200), 66723 states have internal predecessors, (88200), 0 states have call successors, (0), 0 states 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 03:21:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66724 states to 66724 states and 88200 transitions. [2024-10-11 03:21:29,775 INFO L78 Accepts]: Start accepts. Automaton has 66724 states and 88200 transitions. Word has length 96 [2024-10-11 03:21:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:29,776 INFO L471 AbstractCegarLoop]: Abstraction has 66724 states and 88200 transitions. [2024-10-11 03:21:29,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 66724 states and 88200 transitions. [2024-10-11 03:21:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:21:29,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:29,798 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 03:21:29,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:21:29,799 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:29,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1014182803, now seen corresponding path program 1 times [2024-10-11 03:21:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165478348] [2024-10-11 03:21:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 03:21:29,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:29,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165478348] [2024-10-11 03:21:29,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165478348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:29,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:29,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190652356] [2024-10-11 03:21:29,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:29,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:29,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:29,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:29,847 INFO L87 Difference]: Start difference. First operand 66724 states and 88200 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 03:21:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:32,989 INFO L93 Difference]: Finished difference Result 145891 states and 192731 transitions. [2024-10-11 03:21:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:32,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 96 [2024-10-11 03:21:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:33,105 INFO L225 Difference]: With dead ends: 145891 [2024-10-11 03:21:33,105 INFO L226 Difference]: Without dead ends: 79671 [2024-10-11 03:21:33,129 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 03:21:33,130 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:33,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 155 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79671 states. [2024-10-11 03:21:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79671 to 79669. [2024-10-11 03:21:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79669 states, 79668 states have (on average 1.2911457548827634) internal successors, (102863), 79668 states have internal predecessors, (102863), 0 states have call successors, (0), 0 states 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 03:21:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79669 states to 79669 states and 102863 transitions. [2024-10-11 03:21:36,778 INFO L78 Accepts]: Start accepts. Automaton has 79669 states and 102863 transitions. Word has length 96 [2024-10-11 03:21:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:36,779 INFO L471 AbstractCegarLoop]: Abstraction has 79669 states and 102863 transitions. [2024-10-11 03:21:36,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 03:21:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 79669 states and 102863 transitions. [2024-10-11 03:21:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:21:36,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:36,808 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 03:21:36,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:21:36,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:36,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1040619566, now seen corresponding path program 1 times [2024-10-11 03:21:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:36,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591470092] [2024-10-11 03:21:36,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:36,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 03:21:36,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:36,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591470092] [2024-10-11 03:21:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591470092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:36,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:36,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257583526] [2024-10-11 03:21:36,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:36,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:36,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:36,860 INFO L87 Difference]: Start difference. First operand 79669 states and 102863 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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 03:21:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:39,079 INFO L93 Difference]: Finished difference Result 99492 states and 127823 transitions. [2024-10-11 03:21:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:39,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 96 [2024-10-11 03:21:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:39,163 INFO L225 Difference]: With dead ends: 99492 [2024-10-11 03:21:39,164 INFO L226 Difference]: Without dead ends: 59431 [2024-10-11 03:21:39,187 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 03:21:39,188 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:39,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 178 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59431 states.