./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 851dc7d49dcc9fde277beeb190c3ab252014728a3bd4281f423bffd927fb4430 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:38:19,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:38:19,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:38:19,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:38:19,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:38:19,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:38:19,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:38:19,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:38:19,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:38:19,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:38:19,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:38:19,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:38:19,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:38:19,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:38:19,166 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:38:19,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:38:19,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:38:19,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:38:19,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:38:19,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:38:19,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:38:19,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:38:19,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:38:19,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:38:19,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:38:19,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:38:19,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:38:19,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:38:19,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:38:19,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:38:19,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:38:19,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:38:19,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:38:19,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:38:19,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:38:19,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:38:19,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:38:19,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:38:19,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:38:19,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:38:19,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:38:19,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:38:19,178 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 -> 851dc7d49dcc9fde277beeb190c3ab252014728a3bd4281f423bffd927fb4430 [2024-11-11 21:38:19,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:38:19,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:38:19,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:38:19,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:38:19,498 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:38:19,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-11 21:38:20,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:38:21,261 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:38:21,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-11 21:38:21,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7d813d3/b716f1ca66b34c02b85642061a5941f6/FLAGb4990d9b5 [2024-11-11 21:38:21,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7d813d3/b716f1ca66b34c02b85642061a5941f6 [2024-11-11 21:38:21,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:38:21,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:38:21,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:38:21,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:38:21,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:38:21,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:21,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c96a478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21, skipping insertion in model container [2024-11-11 21:38:21,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:21,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:38:21,680 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-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2024-11-11 21:38:21,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:38:21,779 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:38:21,825 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-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2024-11-11 21:38:21,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:38:21,898 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:38:21,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21 WrapperNode [2024-11-11 21:38:21,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:38:21,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:38:21,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:38:21,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:38:21,905 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:38:21" (1/1) ... [2024-11-11 21:38:21,918 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:38:21" (1/1) ... [2024-11-11 21:38:21,986 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1034 [2024-11-11 21:38:21,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:38:21,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:38:21,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:38:21,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:38:21,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:21,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:22,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:22,038 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:38:22,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:22,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:22,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:22,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:22,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:22,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:22,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:38:22,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:38:22,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:38:22,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:38:22,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (1/1) ... [2024-11-11 21:38:22,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:38:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:38:22,136 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:38:22,139 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:38:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:38:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:38:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:38:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:38:22,299 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:38:22,301 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:38:23,228 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2024-11-11 21:38:23,229 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:38:23,258 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:38:23,259 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:38:23,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:38:23 BoogieIcfgContainer [2024-11-11 21:38:23,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:38:23,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:38:23,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:38:23,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:38:23,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:38:21" (1/3) ... [2024-11-11 21:38:23,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5988e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:38:23, skipping insertion in model container [2024-11-11 21:38:23,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:21" (2/3) ... [2024-11-11 21:38:23,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5988e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:38:23, skipping insertion in model container [2024-11-11 21:38:23,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:38:23" (3/3) ... [2024-11-11 21:38:23,270 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-11 21:38:23,288 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:38:23,288 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:38:23,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:38:23,360 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;@7fd0e64c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:38:23,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:38:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 256 states have (on average 1.72265625) internal successors, (441), 257 states have internal predecessors, (441), 0 states have call successors, (0), 0 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:38:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 21:38:23,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:23,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:23,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash -165426501, now seen corresponding path program 1 times [2024-11-11 21:38:23,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:23,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872548763] [2024-11-11 21:38:23,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:23,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:24,334 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:38:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872548763] [2024-11-11 21:38:24,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872548763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:24,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:24,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:38:24,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378860877] [2024-11-11 21:38:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:24,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:38:24,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:24,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:38:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:38:24,375 INFO L87 Difference]: Start difference. First operand has 258 states, 256 states have (on average 1.72265625) internal successors, (441), 257 states have internal predecessors, (441), 0 states have call successors, (0), 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 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:38:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:24,772 INFO L93 Difference]: Finished difference Result 1163 states and 1886 transitions. [2024-11-11 21:38:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:38:24,776 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 96 [2024-11-11 21:38:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:24,801 INFO L225 Difference]: With dead ends: 1163 [2024-11-11 21:38:24,801 INFO L226 Difference]: Without dead ends: 1022 [2024-11-11 21:38:24,806 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:38:24,811 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 3878 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3878 SdHoareTripleChecker+Valid, 3983 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:24,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3878 Valid, 3983 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:38:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-11-11 21:38:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 395. [2024-11-11 21:38:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.5076142131979695) internal successors, (594), 394 states have internal predecessors, (594), 0 states have call successors, (0), 0 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:38:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 594 transitions. [2024-11-11 21:38:24,902 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 594 transitions. Word has length 96 [2024-11-11 21:38:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:24,903 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 594 transitions. [2024-11-11 21:38:24,903 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:38:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 594 transitions. [2024-11-11 21:38:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 21:38:24,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:24,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:24,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:38:24,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:24,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1176866191, now seen corresponding path program 1 times [2024-11-11 21:38:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:24,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985577692] [2024-11-11 21:38:24,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:25,414 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:38:25,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:25,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985577692] [2024-11-11 21:38:25,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985577692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:25,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:25,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:38:25,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541036767] [2024-11-11 21:38:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:25,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:38:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:25,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:38:25,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:38:25,426 INFO L87 Difference]: Start difference. First operand 395 states and 594 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:38:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:25,704 INFO L93 Difference]: Finished difference Result 1972 states and 3070 transitions. [2024-11-11 21:38:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:38:25,705 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 97 [2024-11-11 21:38:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:25,712 INFO L225 Difference]: With dead ends: 1972 [2024-11-11 21:38:25,713 INFO L226 Difference]: Without dead ends: 1676 [2024-11-11 21:38:25,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:38:25,719 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 2259 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2259 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:25,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2259 Valid, 1999 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:38:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-11-11 21:38:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1666. [2024-11-11 21:38:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 1.5537537537537538) internal successors, (2587), 1665 states have internal predecessors, (2587), 0 states have call successors, (0), 0 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:38:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2587 transitions. [2024-11-11 21:38:25,779 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2587 transitions. Word has length 97 [2024-11-11 21:38:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:25,779 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2587 transitions. [2024-11-11 21:38:25,780 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:38:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2587 transitions. [2024-11-11 21:38:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 21:38:25,792 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:25,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:25,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:38:25,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:25,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:25,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1298319018, now seen corresponding path program 1 times [2024-11-11 21:38:25,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599206377] [2024-11-11 21:38:25,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:25,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:26,041 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:38:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599206377] [2024-11-11 21:38:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599206377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:38:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735983945] [2024-11-11 21:38:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:26,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:26,045 INFO L87 Difference]: Start difference. First operand 1666 states and 2587 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:26,386 INFO L93 Difference]: Finished difference Result 4636 states and 7277 transitions. [2024-11-11 21:38:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:26,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-11 21:38:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:26,400 INFO L225 Difference]: With dead ends: 4636 [2024-11-11 21:38:26,401 INFO L226 Difference]: Without dead ends: 3021 [2024-11-11 21:38:26,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:38:26,407 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1485 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:26,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 355 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:38:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2024-11-11 21:38:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 3019. [2024-11-11 21:38:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 3018 states have (on average 1.563949635520212) internal successors, (4720), 3018 states have internal predecessors, (4720), 0 states have call successors, (0), 0 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:38:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 4720 transitions. [2024-11-11 21:38:26,473 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 4720 transitions. Word has length 98 [2024-11-11 21:38:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 4720 transitions. [2024-11-11 21:38:26,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 4720 transitions. [2024-11-11 21:38:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 21:38:26,481 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:26,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:26,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:38:26,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:26,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:26,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2114426094, now seen corresponding path program 1 times [2024-11-11 21:38:26,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:26,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390719226] [2024-11-11 21:38:26,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:26,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:26,704 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:38:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390719226] [2024-11-11 21:38:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390719226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:26,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:26,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:38:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999159023] [2024-11-11 21:38:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:26,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:26,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:26,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:26,709 INFO L87 Difference]: Start difference. First operand 3019 states and 4720 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:27,076 INFO L93 Difference]: Finished difference Result 8182 states and 12873 transitions. [2024-11-11 21:38:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:27,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-11 21:38:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:27,096 INFO L225 Difference]: With dead ends: 8182 [2024-11-11 21:38:27,096 INFO L226 Difference]: Without dead ends: 5320 [2024-11-11 21:38:27,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:38:27,103 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1353 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:27,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 363 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:38:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2024-11-11 21:38:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5318. [2024-11-11 21:38:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5318 states, 5317 states have (on average 1.5653564039872108) internal successors, (8323), 5317 states have internal predecessors, (8323), 0 states have call successors, (0), 0 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:38:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 8323 transitions. [2024-11-11 21:38:27,231 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 8323 transitions. Word has length 98 [2024-11-11 21:38:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:27,233 INFO L471 AbstractCegarLoop]: Abstraction has 5318 states and 8323 transitions. [2024-11-11 21:38:27,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 8323 transitions. [2024-11-11 21:38:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 21:38:27,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:27,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:27,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:38:27,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash -280718047, now seen corresponding path program 1 times [2024-11-11 21:38:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:27,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729788666] [2024-11-11 21:38:27,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:27,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:27,411 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:38:27,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729788666] [2024-11-11 21:38:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729788666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:27,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:27,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:38:27,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318697232] [2024-11-11 21:38:27,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:27,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:27,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:27,415 INFO L87 Difference]: Start difference. First operand 5318 states and 8323 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:27,820 INFO L93 Difference]: Finished difference Result 15000 states and 23599 transitions. [2024-11-11 21:38:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:27,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-11 21:38:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:27,856 INFO L225 Difference]: With dead ends: 15000 [2024-11-11 21:38:27,856 INFO L226 Difference]: Without dead ends: 9880 [2024-11-11 21:38:27,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:38:27,868 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1339 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:27,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 372 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:38:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9880 states. [2024-11-11 21:38:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9880 to 9878. [2024-11-11 21:38:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9878 states, 9877 states have (on average 1.5669737774627923) internal successors, (15477), 9877 states have internal predecessors, (15477), 0 states have call successors, (0), 0 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:38:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9878 states to 9878 states and 15477 transitions. [2024-11-11 21:38:28,119 INFO L78 Accepts]: Start accepts. Automaton has 9878 states and 15477 transitions. Word has length 98 [2024-11-11 21:38:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:28,120 INFO L471 AbstractCegarLoop]: Abstraction has 9878 states and 15477 transitions. [2024-11-11 21:38:28,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 9878 states and 15477 transitions. [2024-11-11 21:38:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 21:38:28,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:28,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:28,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:38:28,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:28,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1024308035, now seen corresponding path program 1 times [2024-11-11 21:38:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729749664] [2024-11-11 21:38:28,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:28,323 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:38:28,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729749664] [2024-11-11 21:38:28,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729749664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:28,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:28,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:38:28,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226417737] [2024-11-11 21:38:28,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:28,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:28,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:28,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:28,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:28,327 INFO L87 Difference]: Start difference. First operand 9878 states and 15477 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:28,764 INFO L93 Difference]: Finished difference Result 28884 states and 45351 transitions. [2024-11-11 21:38:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-11 21:38:28,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:28,825 INFO L225 Difference]: With dead ends: 28884 [2024-11-11 21:38:28,826 INFO L226 Difference]: Without dead ends: 19126 [2024-11-11 21:38:28,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:38:28,846 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1377 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:28,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 359 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:38:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19126 states. [2024-11-11 21:38:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19126 to 19124. [2024-11-11 21:38:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19124 states, 19123 states have (on average 1.5631438581812478) internal successors, (29892), 19123 states have internal predecessors, (29892), 0 states have call successors, (0), 0 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:38:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19124 states to 19124 states and 29892 transitions. [2024-11-11 21:38:29,231 INFO L78 Accepts]: Start accepts. Automaton has 19124 states and 29892 transitions. Word has length 98 [2024-11-11 21:38:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:29,231 INFO L471 AbstractCegarLoop]: Abstraction has 19124 states and 29892 transitions. [2024-11-11 21:38:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 19124 states and 29892 transitions. [2024-11-11 21:38:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 21:38:29,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:29,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:29,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:38:29,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:29,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:29,240 INFO L85 PathProgramCache]: Analyzing trace with hash -866521676, now seen corresponding path program 1 times [2024-11-11 21:38:29,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:29,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757370430] [2024-11-11 21:38:29,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:29,484 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:38:29,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757370430] [2024-11-11 21:38:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757370430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:29,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:29,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:38:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179913802] [2024-11-11 21:38:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:29,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:29,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:29,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:29,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:29,488 INFO L87 Difference]: Start difference. First operand 19124 states and 29892 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:30,016 INFO L93 Difference]: Finished difference Result 56728 states and 88774 transitions. [2024-11-11 21:38:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:30,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-11 21:38:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:30,194 INFO L225 Difference]: With dead ends: 56728 [2024-11-11 21:38:30,194 INFO L226 Difference]: Without dead ends: 37694 [2024-11-11 21:38:30,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:38:30,227 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1403 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:30,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 357 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:38:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37694 states. [2024-11-11 21:38:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37694 to 37692. [2024-11-11 21:38:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37692 states, 37691 states have (on average 1.5573479079886445) internal successors, (58698), 37691 states have internal predecessors, (58698), 0 states have call successors, (0), 0 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:38:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37692 states to 37692 states and 58698 transitions. [2024-11-11 21:38:31,148 INFO L78 Accepts]: Start accepts. Automaton has 37692 states and 58698 transitions. Word has length 98 [2024-11-11 21:38:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:31,149 INFO L471 AbstractCegarLoop]: Abstraction has 37692 states and 58698 transitions. [2024-11-11 21:38:31,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:31,154 INFO L276 IsEmpty]: Start isEmpty. Operand 37692 states and 58698 transitions. [2024-11-11 21:38:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 21:38:31,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:31,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:38:31,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:31,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash -677209499, now seen corresponding path program 1 times [2024-11-11 21:38:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:31,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934723434] [2024-11-11 21:38:31,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:31,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:31,559 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:38:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:31,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934723434] [2024-11-11 21:38:31,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934723434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:31,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:38:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181886906] [2024-11-11 21:38:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:31,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:31,567 INFO L87 Difference]: Start difference. First operand 37692 states and 58698 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:32,372 INFO L93 Difference]: Finished difference Result 112444 states and 175228 transitions. [2024-11-11 21:38:32,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:32,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-11 21:38:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:32,701 INFO L225 Difference]: With dead ends: 112444 [2024-11-11 21:38:32,701 INFO L226 Difference]: Without dead ends: 74819 [2024-11-11 21:38:32,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:38:32,798 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1425 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:32,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1425 Valid, 357 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:38:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74819 states. [2024-11-11 21:38:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74819 to 74817. [2024-11-11 21:38:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74817 states, 74816 states have (on average 1.5499625748502994) internal successors, (115962), 74816 states have internal predecessors, (115962), 0 states have call successors, (0), 0 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:38:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74817 states to 74817 states and 115962 transitions. [2024-11-11 21:38:34,352 INFO L78 Accepts]: Start accepts. Automaton has 74817 states and 115962 transitions. Word has length 98 [2024-11-11 21:38:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:34,352 INFO L471 AbstractCegarLoop]: Abstraction has 74817 states and 115962 transitions. [2024-11-11 21:38:34,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:38:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 74817 states and 115962 transitions. [2024-11-11 21:38:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 21:38:34,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:34,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:34,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:38:34,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1615132955, now seen corresponding path program 1 times [2024-11-11 21:38:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067119986] [2024-11-11 21:38:34,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:34,855 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:38:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:34,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067119986] [2024-11-11 21:38:34,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067119986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:34,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:38:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471634701] [2024-11-11 21:38:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:34,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:34,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:34,858 INFO L87 Difference]: Start difference. First operand 74817 states and 115962 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:38:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:35,206 INFO L93 Difference]: Finished difference Result 76355 states and 118267 transitions. [2024-11-11 21:38:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-11 21:38:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:35,370 INFO L225 Difference]: With dead ends: 76355 [2024-11-11 21:38:35,370 INFO L226 Difference]: Without dead ends: 76353 [2024-11-11 21:38:35,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:35,406 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 0 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:35,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1406 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:38:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76353 states. [2024-11-11 21:38:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76353 to 76353. [2024-11-11 21:38:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76353 states, 76352 states have (on average 1.5388987845766975) internal successors, (117498), 76352 states have internal predecessors, (117498), 0 states have call successors, (0), 0 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:38:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76353 states to 76353 states and 117498 transitions. [2024-11-11 21:38:36,474 INFO L78 Accepts]: Start accepts. Automaton has 76353 states and 117498 transitions. Word has length 99 [2024-11-11 21:38:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:36,474 INFO L471 AbstractCegarLoop]: Abstraction has 76353 states and 117498 transitions. [2024-11-11 21:38:36,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:38:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 76353 states and 117498 transitions. [2024-11-11 21:38:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:38:36,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:36,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:36,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:38:36,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:36,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1815671702, now seen corresponding path program 1 times [2024-11-11 21:38:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324652049] [2024-11-11 21:38:36,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:37,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:38:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324652049] [2024-11-11 21:38:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324652049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:38:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192973837] [2024-11-11 21:38:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:37,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:38:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:37,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:38:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:38:37,377 INFO L87 Difference]: Start difference. First operand 76353 states and 117498 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:39,105 INFO L93 Difference]: Finished difference Result 192436 states and 294361 transitions. [2024-11-11 21:38:39,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:38:39,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-11 21:38:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:39,378 INFO L225 Difference]: With dead ends: 192436 [2024-11-11 21:38:39,378 INFO L226 Difference]: Without dead ends: 117185 [2024-11-11 21:38:39,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:38:39,480 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 1797 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:39,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1797 Valid, 1483 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:38:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117185 states. [2024-11-11 21:38:41,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117185 to 76425. [2024-11-11 21:38:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76425 states, 76424 states have (on average 1.5383256568617187) internal successors, (117565), 76424 states have internal predecessors, (117565), 0 states have call successors, (0), 0 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:38:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76425 states to 76425 states and 117565 transitions. [2024-11-11 21:38:41,244 INFO L78 Accepts]: Start accepts. Automaton has 76425 states and 117565 transitions. Word has length 100 [2024-11-11 21:38:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:41,245 INFO L471 AbstractCegarLoop]: Abstraction has 76425 states and 117565 transitions. [2024-11-11 21:38:41,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 76425 states and 117565 transitions. [2024-11-11 21:38:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:38:41,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:41,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:41,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:38:41,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:41,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:41,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1055687702, now seen corresponding path program 1 times [2024-11-11 21:38:41,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:41,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912204825] [2024-11-11 21:38:41,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:41,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:41,619 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:38:41,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:41,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912204825] [2024-11-11 21:38:41,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912204825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:41,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:41,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:38:41,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998896045] [2024-11-11 21:38:41,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:41,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:38:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:41,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:38:41,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:38:41,622 INFO L87 Difference]: Start difference. First operand 76425 states and 117565 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:43,073 INFO L93 Difference]: Finished difference Result 115382 states and 176161 transitions. [2024-11-11 21:38:43,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:38:43,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-11 21:38:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:43,216 INFO L225 Difference]: With dead ends: 115382 [2024-11-11 21:38:43,216 INFO L226 Difference]: Without dead ends: 94260 [2024-11-11 21:38:43,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:38:43,262 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 1668 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:43,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 1201 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:38:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94260 states. [2024-11-11 21:38:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94260 to 77298. [2024-11-11 21:38:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77298 states, 77297 states have (on average 1.5376664036120418) internal successors, (118857), 77297 states have internal predecessors, (118857), 0 states have call successors, (0), 0 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:38:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77298 states to 77298 states and 118857 transitions. [2024-11-11 21:38:44,679 INFO L78 Accepts]: Start accepts. Automaton has 77298 states and 118857 transitions. Word has length 100 [2024-11-11 21:38:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:44,679 INFO L471 AbstractCegarLoop]: Abstraction has 77298 states and 118857 transitions. [2024-11-11 21:38:44,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 77298 states and 118857 transitions. [2024-11-11 21:38:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:38:44,697 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:44,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:44,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:38:44,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:44,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 507491382, now seen corresponding path program 1 times [2024-11-11 21:38:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659355500] [2024-11-11 21:38:44,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:45,254 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:38:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:45,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659355500] [2024-11-11 21:38:45,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659355500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:45,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:38:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087000886] [2024-11-11 21:38:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:45,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:38:45,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:45,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:38:45,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:38:45,257 INFO L87 Difference]: Start difference. First operand 77298 states and 118857 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:46,739 INFO L93 Difference]: Finished difference Result 93327 states and 142675 transitions. [2024-11-11 21:38:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:38:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-11 21:38:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:46,897 INFO L225 Difference]: With dead ends: 93327 [2024-11-11 21:38:46,898 INFO L226 Difference]: Without dead ends: 85684 [2024-11-11 21:38:46,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:38:46,933 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1951 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:46,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 1143 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:38:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85684 states. [2024-11-11 21:38:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85684 to 77298. [2024-11-11 21:38:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77298 states, 77297 states have (on average 1.537614655161261) internal successors, (118853), 77297 states have internal predecessors, (118853), 0 states have call successors, (0), 0 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:38:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77298 states to 77298 states and 118853 transitions. [2024-11-11 21:38:48,120 INFO L78 Accepts]: Start accepts. Automaton has 77298 states and 118853 transitions. Word has length 100 [2024-11-11 21:38:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:48,120 INFO L471 AbstractCegarLoop]: Abstraction has 77298 states and 118853 transitions. [2024-11-11 21:38:48,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 77298 states and 118853 transitions. [2024-11-11 21:38:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:38:48,135 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:48,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:48,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:38:48,136 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:48,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2017397750, now seen corresponding path program 1 times [2024-11-11 21:38:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733533278] [2024-11-11 21:38:48,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:48,604 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:38:48,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:48,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733533278] [2024-11-11 21:38:48,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733533278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:48,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:48,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:38:48,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102982690] [2024-11-11 21:38:48,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:48,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:38:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:48,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:38:48,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:38:48,606 INFO L87 Difference]: Start difference. First operand 77298 states and 118853 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:50,324 INFO L93 Difference]: Finished difference Result 152992 states and 233806 transitions. [2024-11-11 21:38:50,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:38:50,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-11 21:38:50,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:50,522 INFO L225 Difference]: With dead ends: 152992 [2024-11-11 21:38:50,522 INFO L226 Difference]: Without dead ends: 118376 [2024-11-11 21:38:50,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:38:50,576 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1648 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:50,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 1470 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:38:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118376 states. [2024-11-11 21:38:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118376 to 78273. [2024-11-11 21:38:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78273 states, 78272 states have (on average 1.535517170891251) internal successors, (120188), 78272 states have internal predecessors, (120188), 0 states have call successors, (0), 0 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:38:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78273 states to 78273 states and 120188 transitions. [2024-11-11 21:38:52,119 INFO L78 Accepts]: Start accepts. Automaton has 78273 states and 120188 transitions. Word has length 100 [2024-11-11 21:38:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:52,120 INFO L471 AbstractCegarLoop]: Abstraction has 78273 states and 120188 transitions. [2024-11-11 21:38:52,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 78273 states and 120188 transitions. [2024-11-11 21:38:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:38:52,134 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:52,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:52,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:38:52,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:52,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash 671566806, now seen corresponding path program 1 times [2024-11-11 21:38:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:52,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976909708] [2024-11-11 21:38:52,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:52,600 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:38:52,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:52,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976909708] [2024-11-11 21:38:52,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976909708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:52,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:52,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:38:52,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481989147] [2024-11-11 21:38:52,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:52,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:38:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:52,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:38:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:38:52,603 INFO L87 Difference]: Start difference. First operand 78273 states and 120188 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:54,368 INFO L93 Difference]: Finished difference Result 156815 states and 239387 transitions. [2024-11-11 21:38:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:38:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-11 21:38:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:54,553 INFO L225 Difference]: With dead ends: 156815 [2024-11-11 21:38:54,554 INFO L226 Difference]: Without dead ends: 109272 [2024-11-11 21:38:54,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:38:54,605 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 2095 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2095 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:54,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2095 Valid, 1247 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:38:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109272 states. [2024-11-11 21:38:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109272 to 79368. [2024-11-11 21:38:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79368 states, 79367 states have (on average 1.5326647095140298) internal successors, (121643), 79367 states have internal predecessors, (121643), 0 states have call successors, (0), 0 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:38:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79368 states to 79368 states and 121643 transitions. [2024-11-11 21:38:56,112 INFO L78 Accepts]: Start accepts. Automaton has 79368 states and 121643 transitions. Word has length 100 [2024-11-11 21:38:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:56,112 INFO L471 AbstractCegarLoop]: Abstraction has 79368 states and 121643 transitions. [2024-11-11 21:38:56,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 79368 states and 121643 transitions. [2024-11-11 21:38:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:38:56,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:56,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:56,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:38:56,126 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:56,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1374338122, now seen corresponding path program 1 times [2024-11-11 21:38:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:56,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915073875] [2024-11-11 21:38:56,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:56,465 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:38:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915073875] [2024-11-11 21:38:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915073875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:56,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:38:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644266544] [2024-11-11 21:38:56,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:38:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:56,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:38:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:38:56,467 INFO L87 Difference]: Start difference. First operand 79368 states and 121643 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:58,203 INFO L93 Difference]: Finished difference Result 176761 states and 269395 transitions. [2024-11-11 21:38:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:38:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-11 21:38:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:58,397 INFO L225 Difference]: With dead ends: 176761 [2024-11-11 21:38:58,397 INFO L226 Difference]: Without dead ends: 117005 [2024-11-11 21:38:58,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:38:58,460 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 1283 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:58,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1658 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:38:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117005 states. [2024-11-11 21:39:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117005 to 80657. [2024-11-11 21:39:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80657 states, 80656 states have (on average 1.5282805990874826) internal successors, (123265), 80656 states have internal predecessors, (123265), 0 states have call successors, (0), 0 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:39:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80657 states to 80657 states and 123265 transitions. [2024-11-11 21:39:00,384 INFO L78 Accepts]: Start accepts. Automaton has 80657 states and 123265 transitions. Word has length 100 [2024-11-11 21:39:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:00,384 INFO L471 AbstractCegarLoop]: Abstraction has 80657 states and 123265 transitions. [2024-11-11 21:39:00,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 80657 states and 123265 transitions. [2024-11-11 21:39:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:39:00,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:00,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:39:00,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:39:00,400 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:00,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash -416749430, now seen corresponding path program 1 times [2024-11-11 21:39:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:00,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071364698] [2024-11-11 21:39:00,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:00,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:00,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071364698] [2024-11-11 21:39:00,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071364698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:00,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:00,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:39:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319199785] [2024-11-11 21:39:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:00,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:39:00,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:00,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:39:00,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:39:00,630 INFO L87 Difference]: Start difference. First operand 80657 states and 123265 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:39:02,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:02,013 INFO L93 Difference]: Finished difference Result 221845 states and 339827 transitions. [2024-11-11 21:39:02,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:39:02,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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 101 [2024-11-11 21:39:02,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:02,273 INFO L225 Difference]: With dead ends: 221845 [2024-11-11 21:39:02,273 INFO L226 Difference]: Without dead ends: 147347 [2024-11-11 21:39:02,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:39:02,347 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 247 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:02,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 881 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:39:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147347 states. [2024-11-11 21:39:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147347 to 146609. [2024-11-11 21:39:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146609 states, 146608 states have (on average 1.5201421477681982) internal successors, (222865), 146608 states have internal predecessors, (222865), 0 states have call successors, (0), 0 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:39:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146609 states to 146609 states and 222865 transitions. [2024-11-11 21:39:05,111 INFO L78 Accepts]: Start accepts. Automaton has 146609 states and 222865 transitions. Word has length 101 [2024-11-11 21:39:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:05,112 INFO L471 AbstractCegarLoop]: Abstraction has 146609 states and 222865 transitions. [2024-11-11 21:39:05,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:39:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 146609 states and 222865 transitions. [2024-11-11 21:39:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:39:05,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:05,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:39:05,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:39:05,146 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:05,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash -309641867, now seen corresponding path program 1 times [2024-11-11 21:39:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291485970] [2024-11-11 21:39:05,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:05,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:05,318 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:39:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291485970] [2024-11-11 21:39:05,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291485970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:05,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:05,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:39:05,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347790622] [2024-11-11 21:39:05,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:39:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:39:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:39:05,321 INFO L87 Difference]: Start difference. First operand 146609 states and 222865 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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:39:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:06,340 INFO L93 Difference]: Finished difference Result 321313 states and 488863 transitions. [2024-11-11 21:39:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:39:06,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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 101 [2024-11-11 21:39:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:06,683 INFO L225 Difference]: With dead ends: 321313 [2024-11-11 21:39:06,683 INFO L226 Difference]: Without dead ends: 196391 [2024-11-11 21:39:06,815 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:39:06,816 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 251 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:06,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 688 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:39:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196391 states. [2024-11-11 21:39:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196391 to 195317. [2024-11-11 21:39:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195317 states, 195316 states have (on average 1.5059698130209507) internal successors, (294140), 195316 states have internal predecessors, (294140), 0 states have call successors, (0), 0 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:39:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195317 states to 195317 states and 294140 transitions. [2024-11-11 21:39:10,366 INFO L78 Accepts]: Start accepts. Automaton has 195317 states and 294140 transitions. Word has length 101 [2024-11-11 21:39:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:10,366 INFO L471 AbstractCegarLoop]: Abstraction has 195317 states and 294140 transitions. [2024-11-11 21:39:10,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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:39:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 195317 states and 294140 transitions. [2024-11-11 21:39:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:39:10,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:10,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:39:10,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:39:10,385 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:10,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash 773366845, now seen corresponding path program 1 times [2024-11-11 21:39:10,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:10,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136583386] [2024-11-11 21:39:10,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:10,453 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:39:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:10,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136583386] [2024-11-11 21:39:10,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136583386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:10,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:10,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:39:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590578645] [2024-11-11 21:39:10,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:10,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:39:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:10,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:39:10,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:39:10,456 INFO L87 Difference]: Start difference. First operand 195317 states and 294140 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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:39:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:12,255 INFO L93 Difference]: Finished difference Result 251591 states and 378586 transitions. [2024-11-11 21:39:12,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:39:12,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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 101 [2024-11-11 21:39:12,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:12,670 INFO L225 Difference]: With dead ends: 251591 [2024-11-11 21:39:12,670 INFO L226 Difference]: Without dead ends: 211469 [2024-11-11 21:39:12,763 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:39:12,763 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 210 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:12,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 693 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:39:12,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211469 states. [2024-11-11 21:39:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211469 to 192747. [2024-11-11 21:39:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192747 states, 192746 states have (on average 1.4885704502298363) internal successors, (286916), 192746 states have internal predecessors, (286916), 0 states have call successors, (0), 0 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:39:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192747 states to 192747 states and 286916 transitions. [2024-11-11 21:39:16,144 INFO L78 Accepts]: Start accepts. Automaton has 192747 states and 286916 transitions. Word has length 101 [2024-11-11 21:39:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:16,145 INFO L471 AbstractCegarLoop]: Abstraction has 192747 states and 286916 transitions. [2024-11-11 21:39:16,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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:39:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 192747 states and 286916 transitions. [2024-11-11 21:39:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:39:16,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:16,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:39:16,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:39:16,166 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:16,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:16,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1997583596, now seen corresponding path program 1 times [2024-11-11 21:39:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192561611] [2024-11-11 21:39:16,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:16,247 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:39:16,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192561611] [2024-11-11 21:39:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192561611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:39:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964986533] [2024-11-11 21:39:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:16,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:39:16,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:16,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:39:16,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:39:16,250 INFO L87 Difference]: Start difference. First operand 192747 states and 286916 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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)