./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.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 dd1724e619d2e8fc18a4dc8aa6c726656a51fc7e14f993d511c4c773ed4748f3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:16:33,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:16:33,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:16:33,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:16:33,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:16:33,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:16:33,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:16:33,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:16:33,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:16:33,840 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:16:33,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:16:33,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:16:33,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:16:33,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:16:33,843 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:16:33,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:16:33,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:16:33,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:16:33,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:16:33,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:16:33,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:16:33,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:16:33,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:16:33,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:16:33,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:16:33,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:16:33,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:16:33,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:16:33,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:16:33,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:16:33,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:16:33,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:16:33,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:16:33,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:16:33,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:16:33,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:16:33,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:16:33,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:16:33,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:16:33,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:16:33,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:16:33,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:16:33,850 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 -> dd1724e619d2e8fc18a4dc8aa6c726656a51fc7e14f993d511c4c773ed4748f3 [2024-11-11 21:16:34,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:16:34,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:16:34,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:16:34,088 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:16:34,088 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:16:34,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2024-11-11 21:16:35,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:16:35,578 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:16:35,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2024-11-11 21:16:35,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5121cca/599ff06d53e6485fb254b00431092ead/FLAG21929c4da [2024-11-11 21:16:35,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5121cca/599ff06d53e6485fb254b00431092ead [2024-11-11 21:16:35,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:16:35,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:16:35,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:16:35,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:16:35,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:16:35,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:16:35" (1/1) ... [2024-11-11 21:16:35,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118d393b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:35, skipping insertion in model container [2024-11-11 21:16:35,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:16:35" (1/1) ... [2024-11-11 21:16:36,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:16:36,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c[17005,17018] [2024-11-11 21:16:36,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:16:36,300 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:16:36,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c[17005,17018] [2024-11-11 21:16:36,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:16:36,396 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:16:36,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36 WrapperNode [2024-11-11 21:16:36,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:16:36,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:16:36,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:16:36,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:16:36,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,456 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 454 [2024-11-11 21:16:36,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:16:36,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:16:36,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:16:36,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:16:36,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,481 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-11-11 21:16:36,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:16:36,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:16:36,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:16:36,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:16:36,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (1/1) ... [2024-11-11 21:16:36,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:16:36,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:16:36,536 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-11-11 21:16:36,547 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-11-11 21:16:36,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:16:36,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:16:36,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:16:36,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:16:36,669 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:16:36,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:16:37,154 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-11 21:16:37,155 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:16:37,177 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:16:37,181 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:16:37,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:16:37 BoogieIcfgContainer [2024-11-11 21:16:37,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:16:37,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:16:37,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:16:37,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:16:37,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:16:35" (1/3) ... [2024-11-11 21:16:37,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f1e706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:16:37, skipping insertion in model container [2024-11-11 21:16:37,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:36" (2/3) ... [2024-11-11 21:16:37,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f1e706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:16:37, skipping insertion in model container [2024-11-11 21:16:37,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:16:37" (3/3) ... [2024-11-11 21:16:37,214 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2024-11-11 21:16:37,227 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:16:37,227 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:16:37,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:16:37,282 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;@672245e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:16:37,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:16:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.7603305785123966) internal successors, (213), 122 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 21:16:37,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:37,291 INFO L218 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] [2024-11-11 21:16:37,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:37,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1488018444, now seen corresponding path program 1 times [2024-11-11 21:16:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:37,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813142394] [2024-11-11 21:16:37,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:37,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:37,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:37,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813142394] [2024-11-11 21:16:37,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813142394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:37,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:37,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:16:37,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469529020] [2024-11-11 21:16:37,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:37,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:16:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:37,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:16:37,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:16:37,734 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.7603305785123966) internal successors, (213), 122 states have internal predecessors, (213), 0 states have call successors, (0), 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 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:37,832 INFO L93 Difference]: Finished difference Result 199 states and 339 transitions. [2024-11-11 21:16:37,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:16:37,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 21:16:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:37,842 INFO L225 Difference]: With dead ends: 199 [2024-11-11 21:16:37,843 INFO L226 Difference]: Without dead ends: 119 [2024-11-11 21:16:37,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-11 21:16:37,849 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:37,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 770 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-11 21:16:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-11 21:16:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 118 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2024-11-11 21:16:37,879 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 37 [2024-11-11 21:16:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:37,880 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2024-11-11 21:16:37,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2024-11-11 21:16:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:16:37,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:37,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:37,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:16:37,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:37,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:37,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1130986818, now seen corresponding path program 1 times [2024-11-11 21:16:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:37,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486651941] [2024-11-11 21:16:37,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:37,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:38,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:38,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486651941] [2024-11-11 21:16:38,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486651941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:38,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:38,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340027026] [2024-11-11 21:16:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:38,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:38,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:38,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:38,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:38,011 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-11-11 21:16:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:38,046 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2024-11-11 21:16:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:38,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 77 [2024-11-11 21:16:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:38,051 INFO L225 Difference]: With dead ends: 255 [2024-11-11 21:16:38,051 INFO L226 Difference]: Without dead ends: 183 [2024-11-11 21:16:38,052 INFO L434 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-11-11 21:16:38,052 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 102 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:38,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-11 21:16:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-11 21:16:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2024-11-11 21:16:38,065 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 77 [2024-11-11 21:16:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:38,065 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2024-11-11 21:16:38,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-11-11 21:16:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2024-11-11 21:16:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:16:38,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:38,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:38,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:16:38,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:38,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash 473931391, now seen corresponding path program 1 times [2024-11-11 21:16:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:38,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574538103] [2024-11-11 21:16:38,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:38,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574538103] [2024-11-11 21:16:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574538103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932916381] [2024-11-11 21:16:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:38,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:38,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:38,203 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-11-11 21:16:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:38,238 INFO L93 Difference]: Finished difference Result 433 states and 679 transitions. [2024-11-11 21:16:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 77 [2024-11-11 21:16:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:38,241 INFO L225 Difference]: With dead ends: 433 [2024-11-11 21:16:38,241 INFO L226 Difference]: Without dead ends: 299 [2024-11-11 21:16:38,241 INFO L434 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-11-11 21:16:38,242 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 90 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:38,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 335 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-11 21:16:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2024-11-11 21:16:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.5405405405405406) internal successors, (456), 296 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 456 transitions. [2024-11-11 21:16:38,254 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 456 transitions. Word has length 77 [2024-11-11 21:16:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:38,255 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 456 transitions. [2024-11-11 21:16:38,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-11-11 21:16:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 456 transitions. [2024-11-11 21:16:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:16:38,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:38,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:38,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:16:38,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:38,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:38,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1343515712, now seen corresponding path program 1 times [2024-11-11 21:16:38,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:38,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132080950] [2024-11-11 21:16:38,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:38,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132080950] [2024-11-11 21:16:38,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132080950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:38,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:38,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:38,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632288479] [2024-11-11 21:16:38,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:38,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:38,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:38,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:38,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:38,376 INFO L87 Difference]: Start difference. First operand 297 states and 456 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-11-11 21:16:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:38,398 INFO L93 Difference]: Finished difference Result 765 states and 1218 transitions. [2024-11-11 21:16:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 77 [2024-11-11 21:16:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:38,402 INFO L225 Difference]: With dead ends: 765 [2024-11-11 21:16:38,402 INFO L226 Difference]: Without dead ends: 515 [2024-11-11 21:16:38,403 INFO L434 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-11-11 21:16:38,407 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 86 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:38,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 332 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-11 21:16:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2024-11-11 21:16:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.5703125) internal successors, (804), 512 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 804 transitions. [2024-11-11 21:16:38,423 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 804 transitions. Word has length 77 [2024-11-11 21:16:38,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:38,424 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 804 transitions. [2024-11-11 21:16:38,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-11-11 21:16:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 804 transitions. [2024-11-11 21:16:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:16:38,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:38,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:38,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:16:38,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:38,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2057195905, now seen corresponding path program 1 times [2024-11-11 21:16:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573512791] [2024-11-11 21:16:38,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:38,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:38,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573512791] [2024-11-11 21:16:38,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573512791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:38,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:38,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:16:38,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819906123] [2024-11-11 21:16:38,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:38,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:16:38,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:16:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:16:38,590 INFO L87 Difference]: Start difference. First operand 513 states and 804 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:38,806 INFO L93 Difference]: Finished difference Result 3775 states and 6103 transitions. [2024-11-11 21:16:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:16:38,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-11 21:16:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:38,820 INFO L225 Difference]: With dead ends: 3775 [2024-11-11 21:16:38,821 INFO L226 Difference]: Without dead ends: 3309 [2024-11-11 21:16:38,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:16:38,824 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1700 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:38,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 1435 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2024-11-11 21:16:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 977. [2024-11-11 21:16:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.5819672131147542) internal successors, (1544), 976 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1544 transitions. [2024-11-11 21:16:38,903 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1544 transitions. Word has length 77 [2024-11-11 21:16:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:38,904 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1544 transitions. [2024-11-11 21:16:38,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1544 transitions. [2024-11-11 21:16:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:16:38,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:38,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:38,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:16:38,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:38,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:38,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1034759564, now seen corresponding path program 1 times [2024-11-11 21:16:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61112371] [2024-11-11 21:16:38,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:38,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61112371] [2024-11-11 21:16:39,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61112371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:39,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:39,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:16:39,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685940365] [2024-11-11 21:16:39,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:39,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:16:39,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:39,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:16:39,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:16:39,177 INFO L87 Difference]: Start difference. First operand 977 states and 1544 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:39,204 INFO L93 Difference]: Finished difference Result 1027 states and 1609 transitions. [2024-11-11 21:16:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:16:39,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-11 21:16:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:39,208 INFO L225 Difference]: With dead ends: 1027 [2024-11-11 21:16:39,208 INFO L226 Difference]: Without dead ends: 1025 [2024-11-11 21:16:39,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-11 21:16:39,212 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:39,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 640 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:39,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2024-11-11 21:16:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2024-11-11 21:16:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 1.5546875) internal successors, (1592), 1024 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1592 transitions. [2024-11-11 21:16:39,234 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1592 transitions. Word has length 78 [2024-11-11 21:16:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:39,236 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1592 transitions. [2024-11-11 21:16:39,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1592 transitions. [2024-11-11 21:16:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:16:39,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:39,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:39,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:16:39,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:39,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1960196679, now seen corresponding path program 1 times [2024-11-11 21:16:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823992787] [2024-11-11 21:16:39,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823992787] [2024-11-11 21:16:39,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823992787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:39,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:39,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:39,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027988066] [2024-11-11 21:16:39,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:39,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:39,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:39,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:39,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:39,350 INFO L87 Difference]: Start difference. First operand 1025 states and 1592 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-11-11 21:16:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:39,386 INFO L93 Difference]: Finished difference Result 2861 states and 4482 transitions. [2024-11-11 21:16:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:39,387 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-11-11 21:16:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:39,393 INFO L225 Difference]: With dead ends: 2861 [2024-11-11 21:16:39,393 INFO L226 Difference]: Without dead ends: 1883 [2024-11-11 21:16:39,394 INFO L434 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-11-11 21:16:39,395 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 78 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 275 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-11-11 21:16:39,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 275 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2024-11-11 21:16:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1865. [2024-11-11 21:16:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1864 states have (on average 1.5493562231759657) internal successors, (2888), 1864 states have internal predecessors, (2888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2888 transitions. [2024-11-11 21:16:39,434 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2888 transitions. Word has length 79 [2024-11-11 21:16:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:39,435 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2888 transitions. [2024-11-11 21:16:39,435 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-11-11 21:16:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2888 transitions. [2024-11-11 21:16:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:16:39,437 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:39,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:39,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:16:39,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:39,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash -533556915, now seen corresponding path program 1 times [2024-11-11 21:16:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:39,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250479868] [2024-11-11 21:16:39,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:39,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:39,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250479868] [2024-11-11 21:16:39,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250479868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:39,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:39,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294458605] [2024-11-11 21:16:39,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:39,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:39,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:39,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:39,498 INFO L87 Difference]: Start difference. First operand 1865 states and 2888 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:39,546 INFO L93 Difference]: Finished difference Result 5245 states and 8122 transitions. [2024-11-11 21:16:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:39,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-11 21:16:39,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:39,556 INFO L225 Difference]: With dead ends: 5245 [2024-11-11 21:16:39,556 INFO L226 Difference]: Without dead ends: 3427 [2024-11-11 21:16:39,559 INFO L434 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-11-11 21:16:39,559 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 94 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:39,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 349 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3427 states. [2024-11-11 21:16:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 3425. [2024-11-11 21:16:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3425 states, 3424 states have (on average 1.5327102803738317) internal successors, (5248), 3424 states have internal predecessors, (5248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 5248 transitions. [2024-11-11 21:16:39,626 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 5248 transitions. Word has length 80 [2024-11-11 21:16:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:39,626 INFO L471 AbstractCegarLoop]: Abstraction has 3425 states and 5248 transitions. [2024-11-11 21:16:39,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 5248 transitions. [2024-11-11 21:16:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:16:39,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:39,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:39,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:16:39,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:39,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -948610003, now seen corresponding path program 1 times [2024-11-11 21:16:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:39,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795412755] [2024-11-11 21:16:39,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:39,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795412755] [2024-11-11 21:16:39,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795412755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:39,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:39,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:39,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400333601] [2024-11-11 21:16:39,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:39,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:39,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:39,701 INFO L87 Difference]: Start difference. First operand 3425 states and 5248 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:39,799 INFO L93 Difference]: Finished difference Result 9669 states and 14754 transitions. [2024-11-11 21:16:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:39,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-11 21:16:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:39,819 INFO L225 Difference]: With dead ends: 9669 [2024-11-11 21:16:39,819 INFO L226 Difference]: Without dead ends: 6291 [2024-11-11 21:16:39,824 INFO L434 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-11-11 21:16:39,825 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 98 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:39,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 362 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6291 states. [2024-11-11 21:16:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 6289. [2024-11-11 21:16:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6289 states, 6288 states have (on average 1.508905852417303) internal successors, (9488), 6288 states have internal predecessors, (9488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6289 states to 6289 states and 9488 transitions. [2024-11-11 21:16:39,971 INFO L78 Accepts]: Start accepts. Automaton has 6289 states and 9488 transitions. Word has length 80 [2024-11-11 21:16:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:39,971 INFO L471 AbstractCegarLoop]: Abstraction has 6289 states and 9488 transitions. [2024-11-11 21:16:39,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6289 states and 9488 transitions. [2024-11-11 21:16:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:16:39,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:39,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:39,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:16:39,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:39,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash -397116781, now seen corresponding path program 1 times [2024-11-11 21:16:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433079584] [2024-11-11 21:16:39,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433079584] [2024-11-11 21:16:40,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433079584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:40,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:40,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139418913] [2024-11-11 21:16:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:40,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:40,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:40,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:40,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:40,022 INFO L87 Difference]: Start difference. First operand 6289 states and 9488 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:40,149 INFO L93 Difference]: Finished difference Result 12440 states and 18838 transitions. [2024-11-11 21:16:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:40,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-11 21:16:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:40,172 INFO L225 Difference]: With dead ends: 12440 [2024-11-11 21:16:40,173 INFO L226 Difference]: Without dead ends: 9045 [2024-11-11 21:16:40,176 INFO L434 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-11-11 21:16:40,177 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 103 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:40,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 374 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9045 states. [2024-11-11 21:16:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9045 to 9043. [2024-11-11 21:16:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9043 states, 9042 states have (on average 1.4990046449900465) internal successors, (13554), 9042 states have internal predecessors, (13554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9043 states to 9043 states and 13554 transitions. [2024-11-11 21:16:40,363 INFO L78 Accepts]: Start accepts. Automaton has 9043 states and 13554 transitions. Word has length 81 [2024-11-11 21:16:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:40,363 INFO L471 AbstractCegarLoop]: Abstraction has 9043 states and 13554 transitions. [2024-11-11 21:16:40,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 9043 states and 13554 transitions. [2024-11-11 21:16:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:16:40,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:40,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:40,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:16:40,368 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:40,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1213534649, now seen corresponding path program 1 times [2024-11-11 21:16:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:40,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792587805] [2024-11-11 21:16:40,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:16:40,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:40,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792587805] [2024-11-11 21:16:40,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792587805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:40,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:40,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:16:40,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399544569] [2024-11-11 21:16:40,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:40,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:16:40,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:40,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:16:40,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:16:40,579 INFO L87 Difference]: Start difference. First operand 9043 states and 13554 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:40,969 INFO L93 Difference]: Finished difference Result 34753 states and 52617 transitions. [2024-11-11 21:16:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:16:40,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-11 21:16:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:41,023 INFO L225 Difference]: With dead ends: 34753 [2024-11-11 21:16:41,023 INFO L226 Difference]: Without dead ends: 30207 [2024-11-11 21:16:41,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:16:41,033 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 1484 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:41,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1346 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30207 states. [2024-11-11 21:16:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30207 to 13491. [2024-11-11 21:16:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13491 states, 13490 states have (on average 1.4993328391401037) internal successors, (20226), 13490 states have internal predecessors, (20226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 20226 transitions. [2024-11-11 21:16:41,523 INFO L78 Accepts]: Start accepts. Automaton has 13491 states and 20226 transitions. Word has length 111 [2024-11-11 21:16:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:41,523 INFO L471 AbstractCegarLoop]: Abstraction has 13491 states and 20226 transitions. [2024-11-11 21:16:41,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13491 states and 20226 transitions. [2024-11-11 21:16:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:16:41,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:41,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:41,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:16:41,529 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:41,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:41,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2077497925, now seen corresponding path program 1 times [2024-11-11 21:16:41,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584823230] [2024-11-11 21:16:41,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:41,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 21:16:41,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:41,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584823230] [2024-11-11 21:16:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584823230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:41,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:41,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:16:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827830499] [2024-11-11 21:16:41,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:41,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:16:41,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:41,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:16:41,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:16:41,692 INFO L87 Difference]: Start difference. First operand 13491 states and 20226 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:42,341 INFO L93 Difference]: Finished difference Result 39201 states and 59289 transitions. [2024-11-11 21:16:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:16:42,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-11 21:16:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:42,402 INFO L225 Difference]: With dead ends: 39201 [2024-11-11 21:16:42,402 INFO L226 Difference]: Without dead ends: 34655 [2024-11-11 21:16:42,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:16:42,414 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 1583 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:42,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1380 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34655 states. [2024-11-11 21:16:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34655 to 17939. [2024-11-11 21:16:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17939 states, 17938 states have (on average 1.4994982718251757) internal successors, (26898), 17938 states have internal predecessors, (26898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17939 states to 17939 states and 26898 transitions. [2024-11-11 21:16:42,971 INFO L78 Accepts]: Start accepts. Automaton has 17939 states and 26898 transitions. Word has length 111 [2024-11-11 21:16:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:42,972 INFO L471 AbstractCegarLoop]: Abstraction has 17939 states and 26898 transitions. [2024-11-11 21:16:42,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 17939 states and 26898 transitions. [2024-11-11 21:16:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:16:42,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:42,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:42,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:16:42,979 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:42,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 37847421, now seen corresponding path program 1 times [2024-11-11 21:16:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32540320] [2024-11-11 21:16:42,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 21:16:43,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:43,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32540320] [2024-11-11 21:16:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32540320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:43,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:43,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:16:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622618192] [2024-11-11 21:16:43,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:43,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:16:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:43,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:16:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:16:43,135 INFO L87 Difference]: Start difference. First operand 17939 states and 26898 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:43,999 INFO L93 Difference]: Finished difference Result 43649 states and 65961 transitions. [2024-11-11 21:16:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:16:44,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 111 [2024-11-11 21:16:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:44,058 INFO L225 Difference]: With dead ends: 43649 [2024-11-11 21:16:44,059 INFO L226 Difference]: Without dead ends: 39103 [2024-11-11 21:16:44,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:16:44,068 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 1457 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:44,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 1406 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39103 states. [2024-11-11 21:16:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39103 to 22387. [2024-11-11 21:16:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22387 states, 22386 states have (on average 1.499597963012597) internal successors, (33570), 22386 states have internal predecessors, (33570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22387 states to 22387 states and 33570 transitions. [2024-11-11 21:16:44,666 INFO L78 Accepts]: Start accepts. Automaton has 22387 states and 33570 transitions. Word has length 111 [2024-11-11 21:16:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:44,666 INFO L471 AbstractCegarLoop]: Abstraction has 22387 states and 33570 transitions. [2024-11-11 21:16:44,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 22387 states and 33570 transitions. [2024-11-11 21:16:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:16:44,673 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:44,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:44,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:16:44,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:44,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1617220774, now seen corresponding path program 1 times [2024-11-11 21:16:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:44,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860128984] [2024-11-11 21:16:44,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:16:44,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:44,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860128984] [2024-11-11 21:16:44,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860128984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:44,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:44,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:16:44,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857978141] [2024-11-11 21:16:44,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:44,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:16:44,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:44,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:16:44,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:16:44,839 INFO L87 Difference]: Start difference. First operand 22387 states and 33570 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:45,586 INFO L93 Difference]: Finished difference Result 48097 states and 72633 transitions. [2024-11-11 21:16:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:16:45,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 111 [2024-11-11 21:16:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:45,643 INFO L225 Difference]: With dead ends: 48097 [2024-11-11 21:16:45,643 INFO L226 Difference]: Without dead ends: 43551 [2024-11-11 21:16:45,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:16:45,656 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 1290 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:45,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1562 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:16:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43551 states. [2024-11-11 21:16:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43551 to 26835. [2024-11-11 21:16:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26835 states, 26834 states have (on average 1.4996646046060969) internal successors, (40242), 26834 states have internal predecessors, (40242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26835 states to 26835 states and 40242 transitions. [2024-11-11 21:16:46,368 INFO L78 Accepts]: Start accepts. Automaton has 26835 states and 40242 transitions. Word has length 111 [2024-11-11 21:16:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:46,369 INFO L471 AbstractCegarLoop]: Abstraction has 26835 states and 40242 transitions. [2024-11-11 21:16:46,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 26835 states and 40242 transitions. [2024-11-11 21:16:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:16:46,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:46,376 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:46,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:16:46,377 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2032273862, now seen corresponding path program 1 times [2024-11-11 21:16:46,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:46,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387266241] [2024-11-11 21:16:46,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:16:46,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387266241] [2024-11-11 21:16:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387266241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:46,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:46,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:16:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599151283] [2024-11-11 21:16:46,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:46,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:16:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:46,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:16:46,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:16:46,532 INFO L87 Difference]: Start difference. First operand 26835 states and 40242 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:47,381 INFO L93 Difference]: Finished difference Result 52545 states and 79305 transitions. [2024-11-11 21:16:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:16:47,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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 111 [2024-11-11 21:16:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:47,440 INFO L225 Difference]: With dead ends: 52545 [2024-11-11 21:16:47,440 INFO L226 Difference]: Without dead ends: 47999 [2024-11-11 21:16:47,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:16:47,457 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1328 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:47,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 1537 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47999 states. [2024-11-11 21:16:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47999 to 31283. [2024-11-11 21:16:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31283 states, 31282 states have (on average 1.499712294610319) internal successors, (46914), 31282 states have internal predecessors, (46914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31283 states to 31283 states and 46914 transitions. [2024-11-11 21:16:48,401 INFO L78 Accepts]: Start accepts. Automaton has 31283 states and 46914 transitions. Word has length 111 [2024-11-11 21:16:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:48,401 INFO L471 AbstractCegarLoop]: Abstraction has 31283 states and 46914 transitions. [2024-11-11 21:16:48,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 31283 states and 46914 transitions. [2024-11-11 21:16:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 21:16:48,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:48,413 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:48,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:16:48,413 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:48,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash 309000354, now seen corresponding path program 1 times [2024-11-11 21:16:48,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:48,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159983412] [2024-11-11 21:16:48,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159983412] [2024-11-11 21:16:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159983412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590117730] [2024-11-11 21:16:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:48,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:48,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:48,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:48,524 INFO L87 Difference]: Start difference. First operand 31283 states and 46914 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:48,978 INFO L93 Difference]: Finished difference Result 62519 states and 93780 transitions. [2024-11-11 21:16:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-11 21:16:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:49,014 INFO L225 Difference]: With dead ends: 62519 [2024-11-11 21:16:49,014 INFO L226 Difference]: Without dead ends: 31285 [2024-11-11 21:16:49,036 INFO L434 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-11-11 21:16:49,036 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:49,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 365 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31285 states. [2024-11-11 21:16:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31285 to 31283. [2024-11-11 21:16:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31283 states, 31282 states have (on average 1.488971293395563) internal successors, (46578), 31282 states have internal predecessors, (46578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31283 states to 31283 states and 46578 transitions. [2024-11-11 21:16:50,003 INFO L78 Accepts]: Start accepts. Automaton has 31283 states and 46578 transitions. Word has length 112 [2024-11-11 21:16:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:50,003 INFO L471 AbstractCegarLoop]: Abstraction has 31283 states and 46578 transitions. [2024-11-11 21:16:50,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 31283 states and 46578 transitions. [2024-11-11 21:16:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 21:16:50,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:50,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:50,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:16:50,009 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:50,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash 727441569, now seen corresponding path program 1 times [2024-11-11 21:16:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:50,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506249069] [2024-11-11 21:16:50,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:50,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506249069] [2024-11-11 21:16:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506249069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:50,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:50,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:50,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815796385] [2024-11-11 21:16:50,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:50,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:50,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:50,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:50,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:50,100 INFO L87 Difference]: Start difference. First operand 31283 states and 46578 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:50,321 INFO L93 Difference]: Finished difference Result 46903 states and 69844 transitions. [2024-11-11 21:16:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:50,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-11 21:16:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:50,346 INFO L225 Difference]: With dead ends: 46903 [2024-11-11 21:16:50,346 INFO L226 Difference]: Without dead ends: 15669 [2024-11-11 21:16:50,365 INFO L434 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-11-11 21:16:50,366 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 75 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:50,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 346 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15669 states. [2024-11-11 21:16:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15669 to 15667. [2024-11-11 21:16:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15667 states, 15666 states have (on average 1.477467126260692) internal successors, (23146), 15666 states have internal predecessors, (23146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15667 states to 15667 states and 23146 transitions. [2024-11-11 21:16:50,832 INFO L78 Accepts]: Start accepts. Automaton has 15667 states and 23146 transitions. Word has length 112 [2024-11-11 21:16:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:50,832 INFO L471 AbstractCegarLoop]: Abstraction has 15667 states and 23146 transitions. [2024-11-11 21:16:50,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 15667 states and 23146 transitions. [2024-11-11 21:16:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 21:16:50,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:50,836 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:50,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:16:50,836 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:50,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2126946336, now seen corresponding path program 1 times [2024-11-11 21:16:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:50,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012934334] [2024-11-11 21:16:50,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:51,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:51,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012934334] [2024-11-11 21:16:51,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012934334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:16:51,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885120509] [2024-11-11 21:16:51,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:51,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:16:51,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:16:51,271 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-11-11 21:16:51,273 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-11-11 21:16:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:51,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-11 21:16:51,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:16:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:51,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:16:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:52,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885120509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:16:52,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:16:52,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-11-11 21:16:52,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868574498] [2024-11-11 21:16:52,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:16:52,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 21:16:52,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:52,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 21:16:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:16:52,378 INFO L87 Difference]: Start difference. First operand 15667 states and 23146 transitions. Second operand has 22 states, 22 states have (on average 14.954545454545455) internal successors, (329), 22 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:17:00,166 INFO L93 Difference]: Finished difference Result 173731 states and 254226 transitions. [2024-11-11 21:17:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2024-11-11 21:17:00,167 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 14.954545454545455) internal successors, (329), 22 states have internal predecessors, (329), 0 states have call successors, (0), 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 112 [2024-11-11 21:17:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:17:00,357 INFO L225 Difference]: With dead ends: 173731 [2024-11-11 21:17:00,357 INFO L226 Difference]: Without dead ends: 162977 [2024-11-11 21:17:00,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10459 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3626, Invalid=22134, Unknown=0, NotChecked=0, Total=25760 [2024-11-11 21:17:00,394 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 6523 mSDsluCounter, 2597 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6523 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:17:00,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6523 Valid, 2847 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 21:17:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162977 states. [2024-11-11 21:17:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162977 to 137011. [2024-11-11 21:17:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137011 states, 137010 states have (on average 1.4474417925698855) internal successors, (198314), 137010 states have internal predecessors, (198314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137011 states to 137011 states and 198314 transitions. [2024-11-11 21:17:05,249 INFO L78 Accepts]: Start accepts. Automaton has 137011 states and 198314 transitions. Word has length 112 [2024-11-11 21:17:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:17:05,250 INFO L471 AbstractCegarLoop]: Abstraction has 137011 states and 198314 transitions. [2024-11-11 21:17:05,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 14.954545454545455) internal successors, (329), 22 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 137011 states and 198314 transitions. [2024-11-11 21:17:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 21:17:05,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:17:05,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:17:05,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:17:05,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 21:17:05,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:17:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:17:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1460282405, now seen corresponding path program 1 times [2024-11-11 21:17:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:17:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322991989] [2024-11-11 21:17:05,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:17:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:17:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:17:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:17:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:17:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322991989] [2024-11-11 21:17:05,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322991989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:17:05,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:17:05,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:17:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579596111] [2024-11-11 21:17:05,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:17:05,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:17:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:17:05,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:17:05,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:17:05,635 INFO L87 Difference]: Start difference. First operand 137011 states and 198314 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:17:10,714 INFO L93 Difference]: Finished difference Result 252625 states and 367577 transitions. [2024-11-11 21:17:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:17:10,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-11 21:17:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:17:11,028 INFO L225 Difference]: With dead ends: 252625 [2024-11-11 21:17:11,028 INFO L226 Difference]: Without dead ends: 235079 [2024-11-11 21:17:11,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:17:11,080 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1182 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:17:11,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 2106 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:17:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235079 states. [2024-11-11 21:17:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235079 to 154875. [2024-11-11 21:17:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154875 states, 154874 states have (on average 1.446866485013624) internal successors, (224082), 154874 states have internal predecessors, (224082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154875 states to 154875 states and 224082 transitions. [2024-11-11 21:17:16,412 INFO L78 Accepts]: Start accepts. Automaton has 154875 states and 224082 transitions. Word has length 113 [2024-11-11 21:17:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:17:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 154875 states and 224082 transitions. [2024-11-11 21:17:16,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 154875 states and 224082 transitions. [2024-11-11 21:17:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 21:17:16,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:17:16,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:17:16,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:17:16,417 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:17:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:17:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash 923092720, now seen corresponding path program 1 times [2024-11-11 21:17:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:17:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874810158] [2024-11-11 21:17:16,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:17:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:17:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:17:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:17:16,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:17:16,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874810158] [2024-11-11 21:17:16,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874810158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:17:16,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:17:16,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:17:16,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317231332] [2024-11-11 21:17:16,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:17:16,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:17:16,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:17:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:17:16,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:17:16,489 INFO L87 Difference]: Start difference. First operand 154875 states and 224082 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:17:18,396 INFO L93 Difference]: Finished difference Result 217481 states and 313632 transitions. [2024-11-11 21:17:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:17:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-11 21:17:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:17:18,476 INFO L225 Difference]: With dead ends: 217481 [2024-11-11 21:17:18,477 INFO L226 Difference]: Without dead ends: 62655 [2024-11-11 21:17:18,539 INFO L434 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-11-11 21:17:18,540 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 63 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:17:18,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 336 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:17:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62655 states. [2024-11-11 21:17:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62655 to 55741. [2024-11-11 21:17:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55741 states, 55740 states have (on average 1.4219590958019375) internal successors, (79260), 55740 states have internal predecessors, (79260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55741 states to 55741 states and 79260 transitions. [2024-11-11 21:17:20,554 INFO L78 Accepts]: Start accepts. Automaton has 55741 states and 79260 transitions. Word has length 114 [2024-11-11 21:17:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:17:20,555 INFO L471 AbstractCegarLoop]: Abstraction has 55741 states and 79260 transitions. [2024-11-11 21:17:20,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 55741 states and 79260 transitions. [2024-11-11 21:17:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 21:17:20,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:17:20,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:17:20,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:17:20,557 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:17:20,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:17:20,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1268883318, now seen corresponding path program 1 times [2024-11-11 21:17:20,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:17:20,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716075877] [2024-11-11 21:17:20,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:17:20,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:17:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:17:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:17:20,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:17:20,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716075877] [2024-11-11 21:17:20,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716075877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:17:20,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123832670] [2024-11-11 21:17:20,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:17:20,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:17:20,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:17:20,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:17:20,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:17:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:17:21,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 21:17:21,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:17:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:17:21,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:17:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:17:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123832670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:17:22,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:17:22,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-11 21:17:22,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57525573] [2024-11-11 21:17:22,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:17:22,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 21:17:22,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:17:22,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 21:17:22,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:17:22,589 INFO L87 Difference]: Start difference. First operand 55741 states and 79260 transitions. Second operand has 25 states, 25 states have (on average 12.68) internal successors, (317), 24 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)