./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-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dcec1ccd806a412efdabd457261f7c023005f550a4699f0a865a5aa2d5f9f4d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:22:58,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:22:58,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:22:58,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:22:58,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:22:58,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:22:58,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:22:58,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:22:58,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:22:58,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:22:58,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:22:58,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:22:58,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:22:58,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:22:58,656 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:22:58,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:22:58,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:22:58,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:22:58,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:22:58,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:22:58,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:22:58,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:22:58,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:22:58,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:22:58,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:22:58,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:22:58,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:22:58,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:22:58,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:22:58,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:22:58,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:22:58,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:22:58,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:22:58,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:22:58,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:22:58,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:22:58,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:22:58,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:22:58,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:22:58,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:22:58,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:22:58,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:22:58,669 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dcec1ccd806a412efdabd457261f7c023005f550a4699f0a865a5aa2d5f9f4d9 [2024-10-12 20:22:58,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:22:58,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:22:58,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:22:58,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:22:58,960 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:22:58,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:23:00,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:23:00,646 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:23:00,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:23:00,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f955251cb/be1d8d8ff66340cf91f89785205196c2/FLAG5a9f9ea87 [2024-10-12 20:23:00,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f955251cb/be1d8d8ff66340cf91f89785205196c2 [2024-10-12 20:23:00,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:23:00,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:23:00,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:23:00,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:23:00,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:23:00,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:23:00" (1/1) ... [2024-10-12 20:23:00,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d47986c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:00, skipping insertion in model container [2024-10-12 20:23:00,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:23:00" (1/1) ... [2024-10-12 20:23:00,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:23:00,953 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-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5375,5388] [2024-10-12 20:23:00,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:23:01,011 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:23:01,049 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-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5375,5388] [2024-10-12 20:23:01,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:23:01,101 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:23:01,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01 WrapperNode [2024-10-12 20:23:01,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:23:01,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:23:01,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:23:01,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:23:01,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,154 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 465 [2024-10-12 20:23:01,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:23:01,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:23:01,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:23:01,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:23:01,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,202 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-12 20:23:01,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:23:01,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:23:01,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:23:01,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:23:01,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (1/1) ... [2024-10-12 20:23:01,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:23:01,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:23:01,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:23:01,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:23:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:23:01,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:23:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:23:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:23:01,453 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:23:01,455 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:23:01,904 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-12 20:23:01,904 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:23:01,944 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:23:01,944 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:23:01,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:23:01 BoogieIcfgContainer [2024-10-12 20:23:01,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:23:01,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:23:01,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:23:01,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:23:01,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:23:00" (1/3) ... [2024-10-12 20:23:01,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a04f0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:23:01, skipping insertion in model container [2024-10-12 20:23:01,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:23:01" (2/3) ... [2024-10-12 20:23:01,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a04f0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:23:01, skipping insertion in model container [2024-10-12 20:23:01,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:23:01" (3/3) ... [2024-10-12 20:23:01,954 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:23:01,974 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:23:01,975 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:23:02,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:23:02,064 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;@3666cb6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:23:02,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:23:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 109 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 20:23:02,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:02,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:02,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:02,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1500294558, now seen corresponding path program 1 times [2024-10-12 20:23:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:02,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624033487] [2024-10-12 20:23:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:02,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:02,627 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-12 20:23:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624033487] [2024-10-12 20:23:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624033487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:02,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:02,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844807425] [2024-10-12 20:23:02,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:02,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:02,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:02,657 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 109 states have internal predecessors, (183), 0 states have call successors, (0), 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 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:02,732 INFO L93 Difference]: Finished difference Result 262 states and 421 transitions. [2024-10-12 20:23:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:02,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-12 20:23:02,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:02,748 INFO L225 Difference]: With dead ends: 262 [2024-10-12 20:23:02,748 INFO L226 Difference]: Without dead ends: 174 [2024-10-12 20:23:02,751 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-12 20:23:02,754 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 129 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 376 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-12 20:23:02,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 376 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-12 20:23:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2024-10-12 20:23:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.5087719298245614) internal successors, (258), 171 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 258 transitions. [2024-10-12 20:23:02,795 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 258 transitions. Word has length 48 [2024-10-12 20:23:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:02,795 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 258 transitions. [2024-10-12 20:23:02,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 258 transitions. [2024-10-12 20:23:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:23:02,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:02,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:02,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:23:02,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:02,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1904231256, now seen corresponding path program 1 times [2024-10-12 20:23:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:02,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566703767] [2024-10-12 20:23:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:02,934 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-12 20:23:02,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566703767] [2024-10-12 20:23:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566703767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:02,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984785192] [2024-10-12 20:23:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:02,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:02,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:02,939 INFO L87 Difference]: Start difference. First operand 172 states and 258 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:02,983 INFO L93 Difference]: Finished difference Result 432 states and 670 transitions. [2024-10-12 20:23:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:02,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-12 20:23:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:02,986 INFO L225 Difference]: With dead ends: 432 [2024-10-12 20:23:02,986 INFO L226 Difference]: Without dead ends: 286 [2024-10-12 20:23:02,987 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-12 20:23:02,988 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 108 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:02,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 327 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-12 20:23:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2024-10-12 20:23:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.5371024734982333) internal successors, (435), 283 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 435 transitions. [2024-10-12 20:23:03,013 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 435 transitions. Word has length 49 [2024-10-12 20:23:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:03,013 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 435 transitions. [2024-10-12 20:23:03,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 435 transitions. [2024-10-12 20:23:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:23:03,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:03,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:03,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:23:03,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:03,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash -583215553, now seen corresponding path program 1 times [2024-10-12 20:23:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904142612] [2024-10-12 20:23:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:03,128 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-12 20:23:03,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:03,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904142612] [2024-10-12 20:23:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904142612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:03,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193298582] [2024-10-12 20:23:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:03,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:03,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:03,131 INFO L87 Difference]: Start difference. First operand 284 states and 435 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:03,156 INFO L93 Difference]: Finished difference Result 736 states and 1149 transitions. [2024-10-12 20:23:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:03,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-12 20:23:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:03,159 INFO L225 Difference]: With dead ends: 736 [2024-10-12 20:23:03,160 INFO L226 Difference]: Without dead ends: 478 [2024-10-12 20:23:03,164 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-12 20:23:03,165 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 103 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:03,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-12 20:23:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 476. [2024-10-12 20:23:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.5473684210526315) internal successors, (735), 475 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 735 transitions. [2024-10-12 20:23:03,199 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 735 transitions. Word has length 50 [2024-10-12 20:23:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:03,199 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 735 transitions. [2024-10-12 20:23:03,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 735 transitions. [2024-10-12 20:23:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:23:03,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:03,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:03,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:23:03,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:03,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1140177137, now seen corresponding path program 1 times [2024-10-12 20:23:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:03,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451382273] [2024-10-12 20:23:03,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:03,379 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-12 20:23:03,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:03,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451382273] [2024-10-12 20:23:03,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451382273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:03,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:03,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:23:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534041999] [2024-10-12 20:23:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:03,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:23:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:03,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:23:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:03,383 INFO L87 Difference]: Start difference. First operand 476 states and 735 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:03,558 INFO L93 Difference]: Finished difference Result 2726 states and 4280 transitions. [2024-10-12 20:23:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:23:03,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-12 20:23:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:03,569 INFO L225 Difference]: With dead ends: 2726 [2024-10-12 20:23:03,569 INFO L226 Difference]: Without dead ends: 2276 [2024-10-12 20:23:03,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:23:03,577 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1016 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:03,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 1216 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:23:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2024-10-12 20:23:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 924. [2024-10-12 20:23:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.5460455037919827) internal successors, (1427), 923 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1427 transitions. [2024-10-12 20:23:03,653 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1427 transitions. Word has length 51 [2024-10-12 20:23:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:03,653 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1427 transitions. [2024-10-12 20:23:03,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1427 transitions. [2024-10-12 20:23:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:23:03,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:03,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:03,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:23:03,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:03,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1005209156, now seen corresponding path program 1 times [2024-10-12 20:23:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299014506] [2024-10-12 20:23:03,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:03,868 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-12 20:23:03,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299014506] [2024-10-12 20:23:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299014506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:03,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:23:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246871232] [2024-10-12 20:23:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:23:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:23:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:03,871 INFO L87 Difference]: Start difference. First operand 924 states and 1427 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:03,966 INFO L93 Difference]: Finished difference Result 4028 states and 6231 transitions. [2024-10-12 20:23:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:23:03,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 20:23:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:03,978 INFO L225 Difference]: With dead ends: 4028 [2024-10-12 20:23:03,979 INFO L226 Difference]: Without dead ends: 3130 [2024-10-12 20:23:03,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:03,982 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 425 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:03,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 741 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:23:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2024-10-12 20:23:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 3124. [2024-10-12 20:23:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.5405059237912264) internal successors, (4811), 3123 states have internal predecessors, (4811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4811 transitions. [2024-10-12 20:23:04,045 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4811 transitions. Word has length 52 [2024-10-12 20:23:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:04,046 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4811 transitions. [2024-10-12 20:23:04,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4811 transitions. [2024-10-12 20:23:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:23:04,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:04,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:04,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:23:04,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:04,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1230800526, now seen corresponding path program 1 times [2024-10-12 20:23:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:04,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156389768] [2024-10-12 20:23:04,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:04,121 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-12 20:23:04,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156389768] [2024-10-12 20:23:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156389768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:04,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840470969] [2024-10-12 20:23:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:04,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:04,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:04,128 INFO L87 Difference]: Start difference. First operand 3124 states and 4811 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:04,174 INFO L93 Difference]: Finished difference Result 8248 states and 12653 transitions. [2024-10-12 20:23:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:04,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 20:23:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:04,192 INFO L225 Difference]: With dead ends: 8248 [2024-10-12 20:23:04,193 INFO L226 Difference]: Without dead ends: 5150 [2024-10-12 20:23:04,198 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-12 20:23:04,199 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 115 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:04,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 367 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2024-10-12 20:23:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 5148. [2024-10-12 20:23:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5147 states have (on average 1.5160287546143385) internal successors, (7803), 5147 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 7803 transitions. [2024-10-12 20:23:04,343 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 7803 transitions. Word has length 53 [2024-10-12 20:23:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:04,344 INFO L471 AbstractCegarLoop]: Abstraction has 5148 states and 7803 transitions. [2024-10-12 20:23:04,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 7803 transitions. [2024-10-12 20:23:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:23:04,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:04,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:04,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:23:04,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:04,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:04,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1165128050, now seen corresponding path program 1 times [2024-10-12 20:23:04,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:04,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386372237] [2024-10-12 20:23:04,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:04,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:04,688 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-12 20:23:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386372237] [2024-10-12 20:23:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386372237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:04,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:23:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961997171] [2024-10-12 20:23:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:23:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:23:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:23:04,690 INFO L87 Difference]: Start difference. First operand 5148 states and 7803 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:04,738 INFO L93 Difference]: Finished difference Result 5406 states and 8188 transitions. [2024-10-12 20:23:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:23:04,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:23:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:04,758 INFO L225 Difference]: With dead ends: 5406 [2024-10-12 20:23:04,758 INFO L226 Difference]: Without dead ends: 5404 [2024-10-12 20:23:04,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:23:04,765 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:04,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2024-10-12 20:23:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 5404. [2024-10-12 20:23:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5404 states, 5403 states have (on average 1.4915787525448825) internal successors, (8059), 5403 states have internal predecessors, (8059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 8059 transitions. [2024-10-12 20:23:04,908 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 8059 transitions. Word has length 54 [2024-10-12 20:23:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:04,910 INFO L471 AbstractCegarLoop]: Abstraction has 5404 states and 8059 transitions. [2024-10-12 20:23:04,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 8059 transitions. [2024-10-12 20:23:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:23:04,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:04,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:04,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:23:04,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:04,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:04,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1748658131, now seen corresponding path program 1 times [2024-10-12 20:23:04,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:04,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410795218] [2024-10-12 20:23:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:04,991 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-12 20:23:04,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:04,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410795218] [2024-10-12 20:23:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410795218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427315376] [2024-10-12 20:23:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:04,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:04,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:04,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:04,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:04,994 INFO L87 Difference]: Start difference. First operand 5404 states and 8059 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:05,058 INFO L93 Difference]: Finished difference Result 13258 states and 19787 transitions. [2024-10-12 20:23:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:05,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-12 20:23:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:05,090 INFO L225 Difference]: With dead ends: 13258 [2024-10-12 20:23:05,090 INFO L226 Difference]: Without dead ends: 7880 [2024-10-12 20:23:05,104 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-12 20:23:05,106 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 92 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:05,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 279 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2024-10-12 20:23:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7822. [2024-10-12 20:23:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7822 states, 7821 states have (on average 1.4812683800025572) internal successors, (11585), 7821 states have internal predecessors, (11585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7822 states to 7822 states and 11585 transitions. [2024-10-12 20:23:05,298 INFO L78 Accepts]: Start accepts. Automaton has 7822 states and 11585 transitions. Word has length 55 [2024-10-12 20:23:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:05,298 INFO L471 AbstractCegarLoop]: Abstraction has 7822 states and 11585 transitions. [2024-10-12 20:23:05,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 7822 states and 11585 transitions. [2024-10-12 20:23:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:23:05,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:05,303 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:05,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:23:05,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:05,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash -88776474, now seen corresponding path program 1 times [2024-10-12 20:23:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:05,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688387956] [2024-10-12 20:23:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:05,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:05,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688387956] [2024-10-12 20:23:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688387956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:23:05,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677602053] [2024-10-12 20:23:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:05,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:23:05,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:23:05,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:23:05,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:23:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:05,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:23:05,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:23:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:06,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:23:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:07,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677602053] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:23:07,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:23:07,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-12 20:23:07,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544922728] [2024-10-12 20:23:07,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:23:07,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 20:23:07,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:07,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 20:23:07,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:23:07,255 INFO L87 Difference]: Start difference. First operand 7822 states and 11585 transitions. Second operand has 22 states, 22 states have (on average 10.272727272727273) internal successors, (226), 22 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:17,082 INFO L93 Difference]: Finished difference Result 108013 states and 158705 transitions. [2024-10-12 20:23:17,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2024-10-12 20:23:17,083 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.272727272727273) internal successors, (226), 22 states have internal predecessors, (226), 0 states have call successors, (0), 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 78 [2024-10-12 20:23:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:17,337 INFO L225 Difference]: With dead ends: 108013 [2024-10-12 20:23:17,337 INFO L226 Difference]: Without dead ends: 100219 [2024-10-12 20:23:17,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12200 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4753, Invalid=25003, Unknown=0, NotChecked=0, Total=29756 [2024-10-12 20:23:17,400 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 15406 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 3868 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15406 SdHoareTripleChecker+Valid, 3746 SdHoareTripleChecker+Invalid, 4067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 3868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:17,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15406 Valid, 3746 Invalid, 4067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 3868 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 20:23:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100219 states. [2024-10-12 20:23:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100219 to 71153. [2024-10-12 20:23:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71153 states, 71152 states have (on average 1.4375140544187093) internal successors, (102282), 71152 states have internal predecessors, (102282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71153 states to 71153 states and 102282 transitions. [2024-10-12 20:23:19,004 INFO L78 Accepts]: Start accepts. Automaton has 71153 states and 102282 transitions. Word has length 78 [2024-10-12 20:23:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:19,004 INFO L471 AbstractCegarLoop]: Abstraction has 71153 states and 102282 transitions. [2024-10-12 20:23:19,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.272727272727273) internal successors, (226), 22 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 71153 states and 102282 transitions. [2024-10-12 20:23:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:23:19,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:19,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:19,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:23:19,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:23:19,215 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:19,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2021495991, now seen corresponding path program 1 times [2024-10-12 20:23:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:19,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441017069] [2024-10-12 20:23:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:19,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:19,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441017069] [2024-10-12 20:23:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441017069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:19,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412265673] [2024-10-12 20:23:19,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:19,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:19,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:19,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:19,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:19,442 INFO L87 Difference]: Start difference. First operand 71153 states and 102282 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-12 20:23:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:19,940 INFO L93 Difference]: Finished difference Result 153709 states and 220533 transitions. [2024-10-12 20:23:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:19,941 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 79 [2024-10-12 20:23:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:20,141 INFO L225 Difference]: With dead ends: 153709 [2024-10-12 20:23:20,141 INFO L226 Difference]: Without dead ends: 94312 [2024-10-12 20:23:20,222 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-12 20:23:20,222 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 91 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:20,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 342 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94312 states. [2024-10-12 20:23:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94312 to 89634. [2024-10-12 20:23:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89634 states, 89633 states have (on average 1.4220432206888087) internal successors, (127462), 89633 states have internal predecessors, (127462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89634 states to 89634 states and 127462 transitions. [2024-10-12 20:23:22,052 INFO L78 Accepts]: Start accepts. Automaton has 89634 states and 127462 transitions. Word has length 79 [2024-10-12 20:23:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:22,052 INFO L471 AbstractCegarLoop]: Abstraction has 89634 states and 127462 transitions. [2024-10-12 20:23:22,053 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-12 20:23:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 89634 states and 127462 transitions. [2024-10-12 20:23:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:23:22,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:22,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:22,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:23:22,076 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:22,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:22,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1614660175, now seen corresponding path program 1 times [2024-10-12 20:23:22,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:22,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503802811] [2024-10-12 20:23:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:22,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:22,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503802811] [2024-10-12 20:23:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503802811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:22,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:22,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:22,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811322366] [2024-10-12 20:23:22,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:22,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:22,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:22,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:22,157 INFO L87 Difference]: Start difference. First operand 89634 states and 127462 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-12 20:23:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:22,739 INFO L93 Difference]: Finished difference Result 193576 states and 274036 transitions. [2024-10-12 20:23:22,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:22,740 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 79 [2024-10-12 20:23:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:22,919 INFO L225 Difference]: With dead ends: 193576 [2024-10-12 20:23:22,919 INFO L226 Difference]: Without dead ends: 129481 [2024-10-12 20:23:22,972 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-12 20:23:22,973 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 92 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:22,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 334 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129481 states. [2024-10-12 20:23:24,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129481 to 123219. [2024-10-12 20:23:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123219 states, 123218 states have (on average 1.4033339284844746) internal successors, (172916), 123218 states have internal predecessors, (172916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123219 states to 123219 states and 172916 transitions. [2024-10-12 20:23:25,117 INFO L78 Accepts]: Start accepts. Automaton has 123219 states and 172916 transitions. Word has length 79 [2024-10-12 20:23:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:25,117 INFO L471 AbstractCegarLoop]: Abstraction has 123219 states and 172916 transitions. [2024-10-12 20:23:25,117 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-12 20:23:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 123219 states and 172916 transitions. [2024-10-12 20:23:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:23:25,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:25,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:25,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:23:25,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:25,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash -262022602, now seen corresponding path program 1 times [2024-10-12 20:23:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:25,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840342895] [2024-10-12 20:23:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:25,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840342895] [2024-10-12 20:23:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840342895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:25,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:25,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341318908] [2024-10-12 20:23:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:25,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:25,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:25,197 INFO L87 Difference]: Start difference. First operand 123219 states and 172916 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-12 20:23:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:26,306 INFO L93 Difference]: Finished difference Result 205050 states and 285922 transitions. [2024-10-12 20:23:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:26,307 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 79 [2024-10-12 20:23:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:26,481 INFO L225 Difference]: With dead ends: 205050 [2024-10-12 20:23:26,481 INFO L226 Difference]: Without dead ends: 128452 [2024-10-12 20:23:26,511 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-12 20:23:26,511 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 93 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:26,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 353 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128452 states. [2024-10-12 20:23:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128452 to 120795. [2024-10-12 20:23:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120795 states, 120794 states have (on average 1.383247512293657) internal successors, (167088), 120794 states have internal predecessors, (167088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120795 states to 120795 states and 167088 transitions. [2024-10-12 20:23:28,308 INFO L78 Accepts]: Start accepts. Automaton has 120795 states and 167088 transitions. Word has length 79 [2024-10-12 20:23:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:28,308 INFO L471 AbstractCegarLoop]: Abstraction has 120795 states and 167088 transitions. [2024-10-12 20:23:28,309 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-12 20:23:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 120795 states and 167088 transitions. [2024-10-12 20:23:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:23:28,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:28,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:28,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:23:28,318 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:28,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash 663150994, now seen corresponding path program 1 times [2024-10-12 20:23:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:28,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070092284] [2024-10-12 20:23:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:23:28,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:28,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070092284] [2024-10-12 20:23:28,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070092284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:28,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:28,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:23:28,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285047855] [2024-10-12 20:23:28,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:28,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:23:28,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:23:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:28,473 INFO L87 Difference]: Start difference. First operand 120795 states and 167088 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:29,798 INFO L93 Difference]: Finished difference Result 301632 states and 421246 transitions. [2024-10-12 20:23:29,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:23:29,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-12 20:23:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:30,175 INFO L225 Difference]: With dead ends: 301632 [2024-10-12 20:23:30,175 INFO L226 Difference]: Without dead ends: 247820 [2024-10-12 20:23:30,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:23:30,246 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 736 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:30,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1183 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:23:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247820 states. [2024-10-12 20:23:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247820 to 171956. [2024-10-12 20:23:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171956 states, 171955 states have (on average 1.3808670873193567) internal successors, (237447), 171955 states have internal predecessors, (237447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171956 states to 171956 states and 237447 transitions. [2024-10-12 20:23:33,354 INFO L78 Accepts]: Start accepts. Automaton has 171956 states and 237447 transitions. Word has length 79 [2024-10-12 20:23:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:33,354 INFO L471 AbstractCegarLoop]: Abstraction has 171956 states and 237447 transitions. [2024-10-12 20:23:33,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 171956 states and 237447 transitions. [2024-10-12 20:23:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:23:33,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:33,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:33,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:23:33,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:33,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1442337281, now seen corresponding path program 1 times [2024-10-12 20:23:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592826479] [2024-10-12 20:23:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:33,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592826479] [2024-10-12 20:23:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592826479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:33,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:33,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219658551] [2024-10-12 20:23:33,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:33,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:33,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:33,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:33,434 INFO L87 Difference]: Start difference. First operand 171956 states and 237447 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-12 20:23:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:35,363 INFO L93 Difference]: Finished difference Result 411525 states and 568266 transitions. [2024-10-12 20:23:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:35,364 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 79 [2024-10-12 20:23:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:35,697 INFO L225 Difference]: With dead ends: 411525 [2024-10-12 20:23:35,697 INFO L226 Difference]: Without dead ends: 252015 [2024-10-12 20:23:35,748 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-12 20:23:35,749 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:35,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 322 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252015 states. [2024-10-12 20:23:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252015 to 243695. [2024-10-12 20:23:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243695 states, 243694 states have (on average 1.3685892964127142) internal successors, (333517), 243694 states have internal predecessors, (333517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243695 states to 243695 states and 333517 transitions. [2024-10-12 20:23:39,665 INFO L78 Accepts]: Start accepts. Automaton has 243695 states and 333517 transitions. Word has length 79 [2024-10-12 20:23:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:39,666 INFO L471 AbstractCegarLoop]: Abstraction has 243695 states and 333517 transitions. [2024-10-12 20:23:39,666 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-12 20:23:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 243695 states and 333517 transitions. [2024-10-12 20:23:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:23:39,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:39,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:39,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:23:39,677 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:39,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1953488543, now seen corresponding path program 1 times [2024-10-12 20:23:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:39,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51599828] [2024-10-12 20:23:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:23:39,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:39,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51599828] [2024-10-12 20:23:39,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51599828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:39,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:39,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:23:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120297395] [2024-10-12 20:23:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:39,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:23:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:23:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:39,852 INFO L87 Difference]: Start difference. First operand 243695 states and 333517 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:42,054 INFO L93 Difference]: Finished difference Result 479322 states and 662539 transitions. [2024-10-12 20:23:42,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:23:42,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 79 [2024-10-12 20:23:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:42,773 INFO L225 Difference]: With dead ends: 479322 [2024-10-12 20:23:42,773 INFO L226 Difference]: Without dead ends: 413509 [2024-10-12 20:23:42,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:23:42,900 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 774 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:42,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 983 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413509 states. [2024-10-12 20:23:47,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413509 to 296792. [2024-10-12 20:23:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296792 states, 296791 states have (on average 1.3685623890212304) internal successors, (406177), 296791 states have internal predecessors, (406177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296792 states to 296792 states and 406177 transitions. [2024-10-12 20:23:48,839 INFO L78 Accepts]: Start accepts. Automaton has 296792 states and 406177 transitions. Word has length 79 [2024-10-12 20:23:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:48,839 INFO L471 AbstractCegarLoop]: Abstraction has 296792 states and 406177 transitions. [2024-10-12 20:23:48,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 296792 states and 406177 transitions. [2024-10-12 20:23:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:23:48,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:48,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:48,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:23:48,847 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:48,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1314733110, now seen corresponding path program 1 times [2024-10-12 20:23:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998380776] [2024-10-12 20:23:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:23:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998380776] [2024-10-12 20:23:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998380776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:23:48,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674693393] [2024-10-12 20:23:48,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:48,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:23:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:48,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:23:48,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:48,965 INFO L87 Difference]: Start difference. First operand 296792 states and 406177 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:51,004 INFO L93 Difference]: Finished difference Result 499891 states and 689343 transitions. [2024-10-12 20:23:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:23:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-12 20:23:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:51,683 INFO L225 Difference]: With dead ends: 499891 [2024-10-12 20:23:51,683 INFO L226 Difference]: Without dead ends: 455867 [2024-10-12 20:23:51,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:23:51,777 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 752 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:51,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1046 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:23:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455867 states.