./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.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 742f5d2e7cf114f57c75e9ec70cbf1110245ef125564c2c81d93a290329b3301 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:34:47,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:34:47,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:34:47,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:34:47,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:34:47,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:34:47,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:34:47,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:34:47,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:34:47,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:34:47,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:34:47,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:34:47,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:34:47,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:34:47,716 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:34:47,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:34:47,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:34:47,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:34:47,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:34:47,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:34:47,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:34:47,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:34:47,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:34:47,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:34:47,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:34:47,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:34:47,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:34:47,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:34:47,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:34:47,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:34:47,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:34:47,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:34:47,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:34:47,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:34:47,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:34:47,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:34:47,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:34:47,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:34:47,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:34:47,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:34:47,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:34:47,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:34:47,726 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 -> 742f5d2e7cf114f57c75e9ec70cbf1110245ef125564c2c81d93a290329b3301 [2024-10-12 20:34:48,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:34:48,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:34:48,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:34:48,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:34:48,034 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:34:48,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:34:49,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:34:49,780 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:34:49,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:34:49,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f631c1b1b/c8d4bfa8f45845448730f9628849fd34/FLAG1901be929 [2024-10-12 20:34:49,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f631c1b1b/c8d4bfa8f45845448730f9628849fd34 [2024-10-12 20:34:49,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:34:49,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:34:49,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:34:49,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:34:49,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:34:49,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:34:49" (1/1) ... [2024-10-12 20:34:49,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10637d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:49, skipping insertion in model container [2024-10-12 20:34:49,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:34:49" (1/1) ... [2024-10-12 20:34:49,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:34:50,281 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15866,15879] [2024-10-12 20:34:50,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:34:50,365 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:34:50,480 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15866,15879] [2024-10-12 20:34:50,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:34:50,545 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:34:50,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50 WrapperNode [2024-10-12 20:34:50,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:34:50,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:34:50,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:34:50,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:34:50,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,629 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1376 [2024-10-12 20:34:50,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:34:50,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:34:50,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:34:50,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:34:50,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,687 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:34:50,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:34:50,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:34:50,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:34:50,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:34:50,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (1/1) ... [2024-10-12 20:34:50,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:34:50,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:34:50,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:34:50,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:34:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:34:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:34:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:34:50,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:34:51,003 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:34:51,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:34:52,168 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-12 20:34:52,168 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:34:52,258 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:34:52,258 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:34:52,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:34:52 BoogieIcfgContainer [2024-10-12 20:34:52,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:34:52,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:34:52,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:34:52,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:34:52,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:34:49" (1/3) ... [2024-10-12 20:34:52,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609d902a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:34:52, skipping insertion in model container [2024-10-12 20:34:52,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:34:50" (2/3) ... [2024-10-12 20:34:52,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609d902a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:34:52, skipping insertion in model container [2024-10-12 20:34:52,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:34:52" (3/3) ... [2024-10-12 20:34:52,272 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:34:52,289 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:34:52,290 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:34:52,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:34:52,380 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;@3bf7eebf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:34:52,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:34:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 340 states have (on average 1.7735294117647058) internal successors, (603), 341 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 20:34:52,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:52,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:52,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:52,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2070507114, now seen corresponding path program 1 times [2024-10-12 20:34:52,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:52,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182917147] [2024-10-12 20:34:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:52,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:53,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182917147] [2024-10-12 20:34:53,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182917147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:53,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:53,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439341623] [2024-10-12 20:34:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:53,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:53,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:53,162 INFO L87 Difference]: Start difference. First operand has 342 states, 340 states have (on average 1.7735294117647058) internal successors, (603), 341 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:53,326 INFO L93 Difference]: Finished difference Result 698 states and 1216 transitions. [2024-10-12 20:34:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:53,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2024-10-12 20:34:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:53,359 INFO L225 Difference]: With dead ends: 698 [2024-10-12 20:34:53,359 INFO L226 Difference]: Without dead ends: 564 [2024-10-12 20:34:53,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:53,366 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 417 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:53,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 999 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-10-12 20:34:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 562. [2024-10-12 20:34:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.499108734402852) internal successors, (841), 561 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 841 transitions. [2024-10-12 20:34:53,475 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 841 transitions. Word has length 154 [2024-10-12 20:34:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:53,476 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 841 transitions. [2024-10-12 20:34:53,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 841 transitions. [2024-10-12 20:34:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 20:34:53,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:53,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:53,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:34:53,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:53,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1178225863, now seen corresponding path program 1 times [2024-10-12 20:34:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:53,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402233499] [2024-10-12 20:34:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402233499] [2024-10-12 20:34:54,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402233499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:54,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:54,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246355936] [2024-10-12 20:34:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:54,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:54,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:54,309 INFO L87 Difference]: Start difference. First operand 562 states and 841 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:54,434 INFO L93 Difference]: Finished difference Result 2149 states and 3195 transitions. [2024-10-12 20:34:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:54,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2024-10-12 20:34:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:54,443 INFO L225 Difference]: With dead ends: 2149 [2024-10-12 20:34:54,443 INFO L226 Difference]: Without dead ends: 1611 [2024-10-12 20:34:54,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:54,449 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 1044 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:54,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1682 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-10-12 20:34:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1086. [2024-10-12 20:34:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.4820276497695852) internal successors, (1608), 1085 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1608 transitions. [2024-10-12 20:34:54,504 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1608 transitions. Word has length 154 [2024-10-12 20:34:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:54,506 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1608 transitions. [2024-10-12 20:34:54,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1608 transitions. [2024-10-12 20:34:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-12 20:34:54,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:54,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:34:54,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:54,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash 836221869, now seen corresponding path program 1 times [2024-10-12 20:34:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882134323] [2024-10-12 20:34:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882134323] [2024-10-12 20:34:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882134323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:54,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:54,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:54,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925188449] [2024-10-12 20:34:54,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:54,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:54,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:54,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:54,657 INFO L87 Difference]: Start difference. First operand 1086 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:54,690 INFO L93 Difference]: Finished difference Result 2147 states and 3173 transitions. [2024-10-12 20:34:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:54,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-12 20:34:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:54,695 INFO L225 Difference]: With dead ends: 2147 [2024-10-12 20:34:54,695 INFO L226 Difference]: Without dead ends: 1088 [2024-10-12 20:34:54,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:54,701 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:54,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 999 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-12 20:34:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2024-10-12 20:34:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4811407543698252) internal successors, (1610), 1087 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1610 transitions. [2024-10-12 20:34:54,730 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1610 transitions. Word has length 155 [2024-10-12 20:34:54,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:54,730 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1610 transitions. [2024-10-12 20:34:54,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1610 transitions. [2024-10-12 20:34:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-12 20:34:54,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:54,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:54,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:34:54,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:54,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1170517208, now seen corresponding path program 1 times [2024-10-12 20:34:54,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:54,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745636689] [2024-10-12 20:34:54,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:54,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745636689] [2024-10-12 20:34:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745636689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:55,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228719608] [2024-10-12 20:34:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:55,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:55,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:55,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:55,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:55,358 INFO L87 Difference]: Start difference. First operand 1088 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:55,398 INFO L93 Difference]: Finished difference Result 2163 states and 3199 transitions. [2024-10-12 20:34:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:55,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-12 20:34:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:55,404 INFO L225 Difference]: With dead ends: 2163 [2024-10-12 20:34:55,404 INFO L226 Difference]: Without dead ends: 1088 [2024-10-12 20:34:55,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:55,406 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 20 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:55,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1570 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-12 20:34:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1087. [2024-10-12 20:34:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.4788213627992635) internal successors, (1606), 1086 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1606 transitions. [2024-10-12 20:34:55,436 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1606 transitions. Word has length 156 [2024-10-12 20:34:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:55,436 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1606 transitions. [2024-10-12 20:34:55,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1606 transitions. [2024-10-12 20:34:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-12 20:34:55,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:55,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:55,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:34:55,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1440108541, now seen corresponding path program 1 times [2024-10-12 20:34:55,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:55,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799570588] [2024-10-12 20:34:55,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:55,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:56,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:56,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799570588] [2024-10-12 20:34:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799570588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:56,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:56,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:56,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078916568] [2024-10-12 20:34:56,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:56,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:56,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:56,006 INFO L87 Difference]: Start difference. First operand 1087 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:56,043 INFO L93 Difference]: Finished difference Result 2166 states and 3200 transitions. [2024-10-12 20:34:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-12 20:34:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:56,048 INFO L225 Difference]: With dead ends: 2166 [2024-10-12 20:34:56,048 INFO L226 Difference]: Without dead ends: 1085 [2024-10-12 20:34:56,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:56,051 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 23 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:56,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1572 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-10-12 20:34:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2024-10-12 20:34:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1084 states have (on average 1.477859778597786) internal successors, (1602), 1084 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2024-10-12 20:34:56,076 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 156 [2024-10-12 20:34:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:56,076 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2024-10-12 20:34:56,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2024-10-12 20:34:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-12 20:34:56,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:56,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:56,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:34:56,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:56,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 667678976, now seen corresponding path program 1 times [2024-10-12 20:34:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:56,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862870088] [2024-10-12 20:34:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862870088] [2024-10-12 20:34:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862870088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:56,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:56,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:56,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894636374] [2024-10-12 20:34:56,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:56,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:56,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:56,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:56,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:56,196 INFO L87 Difference]: Start difference. First operand 1085 states and 1602 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:56,266 INFO L93 Difference]: Finished difference Result 2506 states and 3710 transitions. [2024-10-12 20:34:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:56,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-12 20:34:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:56,273 INFO L225 Difference]: With dead ends: 2506 [2024-10-12 20:34:56,273 INFO L226 Difference]: Without dead ends: 1610 [2024-10-12 20:34:56,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:56,275 INFO L432 NwaCegarLoop]: 941 mSDtfsCounter, 426 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:56,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1388 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2024-10-12 20:34:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1608. [2024-10-12 20:34:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.4586185438705663) internal successors, (2344), 1607 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2344 transitions. [2024-10-12 20:34:56,314 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2344 transitions. Word has length 156 [2024-10-12 20:34:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:56,314 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2344 transitions. [2024-10-12 20:34:56,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2344 transitions. [2024-10-12 20:34:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-12 20:34:56,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:56,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:56,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:34:56,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:56,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash 173126011, now seen corresponding path program 1 times [2024-10-12 20:34:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:56,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610756020] [2024-10-12 20:34:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:56,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:56,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610756020] [2024-10-12 20:34:56,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610756020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:56,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:56,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:56,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110276995] [2024-10-12 20:34:56,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:56,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:56,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:56,415 INFO L87 Difference]: Start difference. First operand 1608 states and 2344 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:56,481 INFO L93 Difference]: Finished difference Result 3805 states and 5666 transitions. [2024-10-12 20:34:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:56,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-12 20:34:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:56,491 INFO L225 Difference]: With dead ends: 3805 [2024-10-12 20:34:56,491 INFO L226 Difference]: Without dead ends: 2378 [2024-10-12 20:34:56,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:56,495 INFO L432 NwaCegarLoop]: 701 mSDtfsCounter, 315 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:56,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1069 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2024-10-12 20:34:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2050. [2024-10-12 20:34:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2049 states have (on average 1.495851634943875) internal successors, (3065), 2049 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3065 transitions. [2024-10-12 20:34:56,541 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3065 transitions. Word has length 158 [2024-10-12 20:34:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:56,543 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 3065 transitions. [2024-10-12 20:34:56,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3065 transitions. [2024-10-12 20:34:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-12 20:34:56,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:56,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:56,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:34:56,546 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:56,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash -373275925, now seen corresponding path program 1 times [2024-10-12 20:34:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205474674] [2024-10-12 20:34:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:56,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:56,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:56,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205474674] [2024-10-12 20:34:56,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205474674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:56,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:56,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:56,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506111931] [2024-10-12 20:34:56,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:56,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:56,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:56,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:56,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:56,637 INFO L87 Difference]: Start difference. First operand 2050 states and 3065 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:56,700 INFO L93 Difference]: Finished difference Result 4929 states and 7511 transitions. [2024-10-12 20:34:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-10-12 20:34:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:56,713 INFO L225 Difference]: With dead ends: 4929 [2024-10-12 20:34:56,714 INFO L226 Difference]: Without dead ends: 3144 [2024-10-12 20:34:56,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:56,719 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 310 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:56,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1029 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:34:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2024-10-12 20:34:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2828. [2024-10-12 20:34:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2827 states have (on average 1.5298903431199151) internal successors, (4325), 2827 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4325 transitions. [2024-10-12 20:34:56,792 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4325 transitions. Word has length 160 [2024-10-12 20:34:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:56,792 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 4325 transitions. [2024-10-12 20:34:56,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4325 transitions. [2024-10-12 20:34:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:34:56,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:56,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:56,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:34:56,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:56,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash -81754159, now seen corresponding path program 1 times [2024-10-12 20:34:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:56,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577359235] [2024-10-12 20:34:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:56,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:57,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577359235] [2024-10-12 20:34:57,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577359235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:57,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:57,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:57,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449224669] [2024-10-12 20:34:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:57,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:34:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:57,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:34:57,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:34:57,006 INFO L87 Difference]: Start difference. First operand 2828 states and 4325 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:57,206 INFO L93 Difference]: Finished difference Result 5481 states and 8430 transitions. [2024-10-12 20:34:57,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:34:57,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-12 20:34:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:57,219 INFO L225 Difference]: With dead ends: 5481 [2024-10-12 20:34:57,219 INFO L226 Difference]: Without dead ends: 2828 [2024-10-12 20:34:57,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:34:57,225 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 1314 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:57,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 472 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2024-10-12 20:34:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2828. [2024-10-12 20:34:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2827 states have (on average 1.517509727626459) internal successors, (4290), 2827 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4290 transitions. [2024-10-12 20:34:57,294 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4290 transitions. Word has length 161 [2024-10-12 20:34:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:57,295 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 4290 transitions. [2024-10-12 20:34:57,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4290 transitions. [2024-10-12 20:34:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:34:57,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:57,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:57,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:34:57,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:57,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash 448774060, now seen corresponding path program 1 times [2024-10-12 20:34:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:57,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419902481] [2024-10-12 20:34:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:57,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:57,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419902481] [2024-10-12 20:34:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419902481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:57,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:57,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:34:57,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386869114] [2024-10-12 20:34:57,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:57,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:34:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:57,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:34:57,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:57,754 INFO L87 Difference]: Start difference. First operand 2828 states and 4290 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:57,881 INFO L93 Difference]: Finished difference Result 7156 states and 11129 transitions. [2024-10-12 20:34:57,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:34:57,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-12 20:34:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:57,901 INFO L225 Difference]: With dead ends: 7156 [2024-10-12 20:34:57,901 INFO L226 Difference]: Without dead ends: 5280 [2024-10-12 20:34:57,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:34:57,906 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 628 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:57,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 957 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2024-10-12 20:34:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 5278. [2024-10-12 20:34:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5278 states, 5277 states have (on average 1.5279514875876445) internal successors, (8063), 5277 states have internal predecessors, (8063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 8063 transitions. [2024-10-12 20:34:58,083 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 8063 transitions. Word has length 161 [2024-10-12 20:34:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:58,084 INFO L471 AbstractCegarLoop]: Abstraction has 5278 states and 8063 transitions. [2024-10-12 20:34:58,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 8063 transitions. [2024-10-12 20:34:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:34:58,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:58,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:58,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:34:58,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:58,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash 870161820, now seen corresponding path program 1 times [2024-10-12 20:34:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857866751] [2024-10-12 20:34:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857866751] [2024-10-12 20:34:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857866751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:58,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:58,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:34:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636776119] [2024-10-12 20:34:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:58,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:34:58,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:58,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:34:58,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:34:58,341 INFO L87 Difference]: Start difference. First operand 5278 states and 8063 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:58,563 INFO L93 Difference]: Finished difference Result 14008 states and 22181 transitions. [2024-10-12 20:34:58,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:34:58,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-12 20:34:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:58,608 INFO L225 Difference]: With dead ends: 14008 [2024-10-12 20:34:58,608 INFO L226 Difference]: Without dead ends: 12267 [2024-10-12 20:34:58,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:34:58,618 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 1102 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:58,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1540 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12267 states. [2024-10-12 20:34:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12267 to 8789. [2024-10-12 20:34:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8789 states, 8788 states have (on average 1.5595129722348657) internal successors, (13705), 8788 states have internal predecessors, (13705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8789 states to 8789 states and 13705 transitions. [2024-10-12 20:34:58,887 INFO L78 Accepts]: Start accepts. Automaton has 8789 states and 13705 transitions. Word has length 161 [2024-10-12 20:34:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:58,887 INFO L471 AbstractCegarLoop]: Abstraction has 8789 states and 13705 transitions. [2024-10-12 20:34:58,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 8789 states and 13705 transitions. [2024-10-12 20:34:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:34:58,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:58,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:34:58,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1702363423, now seen corresponding path program 1 times [2024-10-12 20:34:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:58,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205730378] [2024-10-12 20:34:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:34:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:59,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205730378] [2024-10-12 20:34:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205730378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:59,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:34:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061489196] [2024-10-12 20:34:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:59,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:34:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:34:59,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:59,018 INFO L87 Difference]: Start difference. First operand 8789 states and 13705 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:59,162 INFO L93 Difference]: Finished difference Result 22406 states and 35344 transitions. [2024-10-12 20:34:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:34:59,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-12 20:34:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:59,202 INFO L225 Difference]: With dead ends: 22406 [2024-10-12 20:34:59,202 INFO L226 Difference]: Without dead ends: 15304 [2024-10-12 20:34:59,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:34:59,218 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 300 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:59,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 795 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15304 states. [2024-10-12 20:34:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15304 to 15302. [2024-10-12 20:34:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15302 states, 15301 states have (on average 1.558198810535259) internal successors, (23842), 15301 states have internal predecessors, (23842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15302 states to 15302 states and 23842 transitions. [2024-10-12 20:34:59,583 INFO L78 Accepts]: Start accepts. Automaton has 15302 states and 23842 transitions. Word has length 161 [2024-10-12 20:34:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:59,583 INFO L471 AbstractCegarLoop]: Abstraction has 15302 states and 23842 transitions. [2024-10-12 20:34:59,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 15302 states and 23842 transitions. [2024-10-12 20:34:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:34:59,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:59,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:59,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:34:59,591 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:59,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1015953447, now seen corresponding path program 1 times [2024-10-12 20:34:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:59,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725704517] [2024-10-12 20:34:59,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:59,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:00,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-10-12 20:35:00,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:00,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725704517] [2024-10-12 20:35:00,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725704517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:00,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:00,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:00,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794250896] [2024-10-12 20:35:00,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:00,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:00,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:00,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:00,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:00,043 INFO L87 Difference]: Start difference. First operand 15302 states and 23842 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:00,254 INFO L93 Difference]: Finished difference Result 40237 states and 62715 transitions. [2024-10-12 20:35:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-12 20:35:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:00,308 INFO L225 Difference]: With dead ends: 40237 [2024-10-12 20:35:00,308 INFO L226 Difference]: Without dead ends: 24961 [2024-10-12 20:35:00,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:35:00,337 INFO L432 NwaCegarLoop]: 848 mSDtfsCounter, 424 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:00,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 2115 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24961 states. [2024-10-12 20:35:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24961 to 24959. [2024-10-12 20:35:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24959 states, 24958 states have (on average 1.5457568715441943) internal successors, (38579), 24958 states have internal predecessors, (38579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24959 states to 24959 states and 38579 transitions. [2024-10-12 20:35:00,962 INFO L78 Accepts]: Start accepts. Automaton has 24959 states and 38579 transitions. Word has length 161 [2024-10-12 20:35:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:00,962 INFO L471 AbstractCegarLoop]: Abstraction has 24959 states and 38579 transitions. [2024-10-12 20:35:00,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 24959 states and 38579 transitions. [2024-10-12 20:35:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 20:35:00,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:00,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:35:00,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:35:00,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:00,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2075358350, now seen corresponding path program 1 times [2024-10-12 20:35:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20849937] [2024-10-12 20:35:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:35:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20849937] [2024-10-12 20:35:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20849937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:01,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:01,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:01,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116746229] [2024-10-12 20:35:01,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:01,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:01,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:01,104 INFO L87 Difference]: Start difference. First operand 24959 states and 38579 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:01,543 INFO L93 Difference]: Finished difference Result 63563 states and 98137 transitions. [2024-10-12 20:35:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:01,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-10-12 20:35:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:01,623 INFO L225 Difference]: With dead ends: 63563 [2024-10-12 20:35:01,624 INFO L226 Difference]: Without dead ends: 38995 [2024-10-12 20:35:01,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:01,653 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 418 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:01,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1017 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38995 states. [2024-10-12 20:35:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38995 to 38993. [2024-10-12 20:35:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38993 states, 38992 states have (on average 1.5266208453016004) internal successors, (59526), 38992 states have internal predecessors, (59526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38993 states to 38993 states and 59526 transitions. [2024-10-12 20:35:02,428 INFO L78 Accepts]: Start accepts. Automaton has 38993 states and 59526 transitions. Word has length 163 [2024-10-12 20:35:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:02,428 INFO L471 AbstractCegarLoop]: Abstraction has 38993 states and 59526 transitions. [2024-10-12 20:35:02,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 38993 states and 59526 transitions. [2024-10-12 20:35:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 20:35:02,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:02,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:35:02,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:35:02,442 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:02,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1341662232, now seen corresponding path program 1 times [2024-10-12 20:35:02,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757053650] [2024-10-12 20:35:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:35:02,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:02,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757053650] [2024-10-12 20:35:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757053650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:02,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:02,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820343951] [2024-10-12 20:35:02,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:02,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:02,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:02,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:02,536 INFO L87 Difference]: Start difference. First operand 38993 states and 59526 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:03,346 INFO L93 Difference]: Finished difference Result 107429 states and 165485 transitions. [2024-10-12 20:35:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:03,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-10-12 20:35:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:03,519 INFO L225 Difference]: With dead ends: 107429 [2024-10-12 20:35:03,519 INFO L226 Difference]: Without dead ends: 68767 [2024-10-12 20:35:03,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:03,551 INFO L432 NwaCegarLoop]: 681 mSDtfsCounter, 301 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:03,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1034 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68767 states. [2024-10-12 20:35:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68767 to 63149. [2024-10-12 20:35:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63149 states, 63148 states have (on average 1.5484417558750871) internal successors, (97781), 63148 states have internal predecessors, (97781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63149 states to 63149 states and 97781 transitions. [2024-10-12 20:35:05,048 INFO L78 Accepts]: Start accepts. Automaton has 63149 states and 97781 transitions. Word has length 167 [2024-10-12 20:35:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:05,048 INFO L471 AbstractCegarLoop]: Abstraction has 63149 states and 97781 transitions. [2024-10-12 20:35:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 63149 states and 97781 transitions. [2024-10-12 20:35:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 20:35:05,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:05,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:35:05,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:35:05,063 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:05,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash -974538840, now seen corresponding path program 1 times [2024-10-12 20:35:05,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:05,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925277036] [2024-10-12 20:35:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:05,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:05,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-10-12 20:35:05,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925277036] [2024-10-12 20:35:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925277036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:35:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410947128] [2024-10-12 20:35:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:05,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:35:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:35:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:35:05,252 INFO L87 Difference]: Start difference. First operand 63149 states and 97781 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:06,590 INFO L93 Difference]: Finished difference Result 228817 states and 360579 transitions. [2024-10-12 20:35:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:35:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-12 20:35:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:07,057 INFO L225 Difference]: With dead ends: 228817 [2024-10-12 20:35:07,058 INFO L226 Difference]: Without dead ends: 173559 [2024-10-12 20:35:07,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:35:07,132 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 1446 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:07,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1914 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:35:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173559 states. [2024-10-12 20:35:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173559 to 102365. [2024-10-12 20:35:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102365 states, 102364 states have (on average 1.5496561291078894) internal successors, (158629), 102364 states have internal predecessors, (158629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102365 states to 102365 states and 158629 transitions. [2024-10-12 20:35:09,617 INFO L78 Accepts]: Start accepts. Automaton has 102365 states and 158629 transitions. Word has length 168 [2024-10-12 20:35:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:09,617 INFO L471 AbstractCegarLoop]: Abstraction has 102365 states and 158629 transitions. [2024-10-12 20:35:09,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 102365 states and 158629 transitions. [2024-10-12 20:35:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 20:35:09,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:09,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:35:09,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:35:09,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:09,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1398464276, now seen corresponding path program 1 times [2024-10-12 20:35:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:09,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704973634] [2024-10-12 20:35:09,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:35:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:10,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704973634] [2024-10-12 20:35:10,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704973634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:10,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:10,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021437486] [2024-10-12 20:35:10,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:10,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:10,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:10,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:10,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:10,020 INFO L87 Difference]: Start difference. First operand 102365 states and 158629 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:12,283 INFO L93 Difference]: Finished difference Result 469841 states and 726638 transitions. [2024-10-12 20:35:12,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:12,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-12 20:35:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:13,143 INFO L225 Difference]: With dead ends: 469841 [2024-10-12 20:35:13,144 INFO L226 Difference]: Without dead ends: 367514 [2024-10-12 20:35:13,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:35:13,276 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 1349 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:13,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 2061 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367514 states. [2024-10-12 20:35:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367514 to 183801. [2024-10-12 20:35:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183801 states, 183800 states have (on average 1.5323286180631122) internal successors, (281642), 183800 states have internal predecessors, (281642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183801 states to 183801 states and 281642 transitions. [2024-10-12 20:35:18,260 INFO L78 Accepts]: Start accepts. Automaton has 183801 states and 281642 transitions. Word has length 168 [2024-10-12 20:35:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:18,261 INFO L471 AbstractCegarLoop]: Abstraction has 183801 states and 281642 transitions. [2024-10-12 20:35:18,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 183801 states and 281642 transitions. [2024-10-12 20:35:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-12 20:35:18,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:18,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:35:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:35:18,287 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:18,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -138200570, now seen corresponding path program 1 times [2024-10-12 20:35:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:18,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622549585] [2024-10-12 20:35:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:35:18,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:18,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622549585] [2024-10-12 20:35:18,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622549585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:18,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:18,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:18,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862698227] [2024-10-12 20:35:18,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:18,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:18,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:18,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:18,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:18,416 INFO L87 Difference]: Start difference. First operand 183801 states and 281642 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:20,453 INFO L93 Difference]: Finished difference Result 367504 states and 563157 transitions. [2024-10-12 20:35:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-10-12 20:35:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:20,811 INFO L225 Difference]: With dead ends: 367504 [2024-10-12 20:35:20,811 INFO L226 Difference]: Without dead ends: 183807 [2024-10-12 20:35:20,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:20,925 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:20,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 967 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183807 states. [2024-10-12 20:35:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183807 to 183807. [2024-10-12 20:35:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183807 states, 183806 states have (on average 1.5323112411999609) internal successors, (281648), 183806 states have internal predecessors, (281648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183807 states to 183807 states and 281648 transitions. [2024-10-12 20:35:23,527 INFO L78 Accepts]: Start accepts. Automaton has 183807 states and 281648 transitions. Word has length 169 [2024-10-12 20:35:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:23,527 INFO L471 AbstractCegarLoop]: Abstraction has 183807 states and 281648 transitions. [2024-10-12 20:35:23,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 183807 states and 281648 transitions. [2024-10-12 20:35:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:23,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:23,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:35:23,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:35:23,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:23,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1299346743, now seen corresponding path program 1 times [2024-10-12 20:35:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115400900] [2024-10-12 20:35:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:35:23,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115400900] [2024-10-12 20:35:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115400900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:23,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:23,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481086369] [2024-10-12 20:35:23,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:23,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:23,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:23,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:23,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:23,673 INFO L87 Difference]: Start difference. First operand 183807 states and 281648 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:26,006 INFO L93 Difference]: Finished difference Result 480835 states and 735402 transitions. [2024-10-12 20:35:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:26,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-12 20:35:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:26,558 INFO L225 Difference]: With dead ends: 480835 [2024-10-12 20:35:26,558 INFO L226 Difference]: Without dead ends: 297773 [2024-10-12 20:35:26,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:26,745 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 400 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:26,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1339 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:26,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297773 states. [2024-10-12 20:35:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297773 to 297771. [2024-10-12 20:35:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297771 states, 297770 states have (on average 1.5118379957685462) internal successors, (450180), 297770 states have internal predecessors, (450180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297771 states to 297771 states and 450180 transitions. [2024-10-12 20:35:32,646 INFO L78 Accepts]: Start accepts. Automaton has 297771 states and 450180 transitions. Word has length 170 [2024-10-12 20:35:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:32,647 INFO L471 AbstractCegarLoop]: Abstraction has 297771 states and 450180 transitions. [2024-10-12 20:35:32,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 297771 states and 450180 transitions. [2024-10-12 20:35:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:32,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:32,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:35:32,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:35:32,677 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:32,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2047181946, now seen corresponding path program 1 times [2024-10-12 20:35:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:32,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221610813] [2024-10-12 20:35:32,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:35:33,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:33,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221610813] [2024-10-12 20:35:33,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221610813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:33,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:33,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:33,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115288421] [2024-10-12 20:35:33,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:33,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:33,192 INFO L87 Difference]: Start difference. First operand 297771 states and 450180 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:35,421 INFO L93 Difference]: Finished difference Result 562344 states and 850055 transitions. [2024-10-12 20:35:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:35,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-12 20:35:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:35,891 INFO L225 Difference]: With dead ends: 562344 [2024-10-12 20:35:35,892 INFO L226 Difference]: Without dead ends: 265242 [2024-10-12 20:35:36,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:36,975 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 15 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:36,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265242 states. [2024-10-12 20:35:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265242 to 265242. [2024-10-12 20:35:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265242 states, 265241 states have (on average 1.5105055402445324) internal successors, (400648), 265241 states have internal predecessors, (400648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)