./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:19:47,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:19:47,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:19:47,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:19:47,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:19:47,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:19:47,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:19:47,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:19:47,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:19:47,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:19:47,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:19:47,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:19:47,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:19:47,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:19:47,282 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:19:47,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:19:47,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:19:47,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:19:47,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:19:47,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:19:47,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:19:47,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:19:47,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:19:47,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:19:47,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:19:47,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:19:47,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:19:47,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:19:47,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:19:47,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:19:47,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:19:47,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:19:47,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:19:47,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:19:47,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:19:47,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:19:47,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:19:47,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:19:47,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:19:47,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:19:47,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:19:47,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:19:47,295 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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2024-10-24 01:19:47,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:19:47,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:19:47,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:19:47,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:19:47,559 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:19:47,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:19:49,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:19:49,254 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:19:49,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:19:49,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca899f736/66ad63c4e7924e4fb09621519f65a3c9/FLAG33d0a5d1e [2024-10-24 01:19:49,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca899f736/66ad63c4e7924e4fb09621519f65a3c9 [2024-10-24 01:19:49,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:19:49,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:19:49,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:19:49,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:19:49,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:19:49,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50473896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49, skipping insertion in model container [2024-10-24 01:19:49,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:19:49,600 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-10-24 01:19:49,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:19:49,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:19:49,677 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-10-24 01:19:49,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:19:49,699 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:19:49,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49 WrapperNode [2024-10-24 01:19:49,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:19:49,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:19:49,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:19:49,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:19:49,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,797 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 442 [2024-10-24 01:19:49,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:19:49,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:19:49,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:19:49,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:19:49,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,826 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-24 01:19:49,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:19:49,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:19:49,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:19:49,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:19:49,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (1/1) ... [2024-10-24 01:19:49,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:19:49,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:49,895 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-24 01:19:49,898 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-24 01:19:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:19:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:19:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:19:49,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:19:50,062 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:19:50,065 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:19:50,674 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-24 01:19:50,674 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:19:50,722 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:19:50,723 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:19:50,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:19:50 BoogieIcfgContainer [2024-10-24 01:19:50,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:19:50,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:19:50,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:19:50,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:19:50,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:19:49" (1/3) ... [2024-10-24 01:19:50,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e25259c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:19:50, skipping insertion in model container [2024-10-24 01:19:50,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:49" (2/3) ... [2024-10-24 01:19:50,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e25259c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:19:50, skipping insertion in model container [2024-10-24 01:19:50,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:19:50" (3/3) ... [2024-10-24 01:19:50,732 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:19:50,748 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:19:50,749 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:19:50,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:19:50,827 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;@55164284, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:19:50,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:19:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 112 states have (on average 1.7946428571428572) internal successors, (201), 113 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-24 01:19:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:19:50,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:50,845 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] [2024-10-24 01:19:50,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:50,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1320925119, now seen corresponding path program 1 times [2024-10-24 01:19:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:50,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053842086] [2024-10-24 01:19:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:51,243 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-24 01:19:51,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:51,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053842086] [2024-10-24 01:19:51,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053842086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:51,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:51,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:19:51,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282912033] [2024-10-24 01:19:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:51,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:19:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:51,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:19:51,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:19:51,271 INFO L87 Difference]: Start difference. First operand has 114 states, 112 states have (on average 1.7946428571428572) internal successors, (201), 113 states have internal predecessors, (201), 0 states have call successors, (0), 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 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 01:19:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:51,308 INFO L93 Difference]: Finished difference Result 178 states and 313 transitions. [2024-10-24 01:19:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:19:51,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-24 01:19:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:51,319 INFO L225 Difference]: With dead ends: 178 [2024-10-24 01:19:51,319 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 01:19:51,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:19:51,325 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:51,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 01:19:51,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-24 01:19:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.7657657657657657) internal successors, (196), 111 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-24 01:19:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 196 transitions. [2024-10-24 01:19:51,387 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 196 transitions. Word has length 34 [2024-10-24 01:19:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:51,387 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 196 transitions. [2024-10-24 01:19:51,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 01:19:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 196 transitions. [2024-10-24 01:19:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:19:51,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:51,389 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] [2024-10-24 01:19:51,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:19:51,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:51,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1285098435, now seen corresponding path program 1 times [2024-10-24 01:19:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:51,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820135018] [2024-10-24 01:19:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:51,608 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-24 01:19:51,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:51,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820135018] [2024-10-24 01:19:51,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820135018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:51,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:51,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:51,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417135176] [2024-10-24 01:19:51,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:51,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:51,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:51,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:51,613 INFO L87 Difference]: Start difference. First operand 112 states and 196 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 01:19:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:51,709 INFO L93 Difference]: Finished difference Result 178 states and 307 transitions. [2024-10-24 01:19:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-24 01:19:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:51,712 INFO L225 Difference]: With dead ends: 178 [2024-10-24 01:19:51,712 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 01:19:51,713 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-24 01:19:51,714 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:51,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 01:19:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-24 01:19:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 111 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-24 01:19:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 175 transitions. [2024-10-24 01:19:51,728 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 175 transitions. Word has length 34 [2024-10-24 01:19:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:51,728 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 175 transitions. [2024-10-24 01:19:51,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 01:19:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 175 transitions. [2024-10-24 01:19:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 01:19:51,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:51,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:51,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:19:51,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1491954151, now seen corresponding path program 1 times [2024-10-24 01:19:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:51,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746428846] [2024-10-24 01:19:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:51,869 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-24 01:19:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746428846] [2024-10-24 01:19:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746428846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394126205] [2024-10-24 01:19:51,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:51,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:51,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:51,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:51,872 INFO L87 Difference]: Start difference. First operand 112 states and 175 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:51,950 INFO L93 Difference]: Finished difference Result 229 states and 374 transitions. [2024-10-24 01:19:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:51,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-24 01:19:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:51,953 INFO L225 Difference]: With dead ends: 229 [2024-10-24 01:19:51,953 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 01:19:51,953 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-24 01:19:51,957 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 82 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:51,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 305 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 01:19:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2024-10-24 01:19:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 162 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 258 transitions. [2024-10-24 01:19:51,969 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 258 transitions. Word has length 54 [2024-10-24 01:19:51,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:51,969 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 258 transitions. [2024-10-24 01:19:51,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 258 transitions. [2024-10-24 01:19:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 01:19:51,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:51,971 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] [2024-10-24 01:19:51,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:19:51,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:51,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2133310945, now seen corresponding path program 1 times [2024-10-24 01:19:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674976295] [2024-10-24 01:19:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:52,102 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-24 01:19:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:52,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674976295] [2024-10-24 01:19:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674976295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:52,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:52,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150679787] [2024-10-24 01:19:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:52,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:52,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:52,106 INFO L87 Difference]: Start difference. First operand 163 states and 258 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:52,139 INFO L93 Difference]: Finished difference Result 377 states and 614 transitions. [2024-10-24 01:19:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-24 01:19:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:52,141 INFO L225 Difference]: With dead ends: 377 [2024-10-24 01:19:52,142 INFO L226 Difference]: Without dead ends: 263 [2024-10-24 01:19:52,142 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-24 01:19:52,144 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 84 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:52,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 318 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-24 01:19:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2024-10-24 01:19:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.6124031007751938) internal successors, (416), 258 states have internal predecessors, (416), 0 states have call successors, (0), 0 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-24 01:19:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 416 transitions. [2024-10-24 01:19:52,161 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 416 transitions. Word has length 56 [2024-10-24 01:19:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:52,162 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 416 transitions. [2024-10-24 01:19:52,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 416 transitions. [2024-10-24 01:19:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 01:19:52,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:52,167 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] [2024-10-24 01:19:52,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:19:52,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:52,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1393501239, now seen corresponding path program 1 times [2024-10-24 01:19:52,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:52,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937576777] [2024-10-24 01:19:52,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:52,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:52,300 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-24 01:19:52,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:52,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937576777] [2024-10-24 01:19:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937576777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023424837] [2024-10-24 01:19:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:52,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:52,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:52,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:52,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:52,305 INFO L87 Difference]: Start difference. First operand 259 states and 416 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:52,340 INFO L93 Difference]: Finished difference Result 651 states and 1062 transitions. [2024-10-24 01:19:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-24 01:19:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:52,342 INFO L225 Difference]: With dead ends: 651 [2024-10-24 01:19:52,344 INFO L226 Difference]: Without dead ends: 441 [2024-10-24 01:19:52,348 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-24 01:19:52,349 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 78 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:52,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 319 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-24 01:19:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 435. [2024-10-24 01:19:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.6129032258064515) internal successors, (700), 434 states have internal predecessors, (700), 0 states have call successors, (0), 0 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-24 01:19:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 700 transitions. [2024-10-24 01:19:52,380 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 700 transitions. Word has length 58 [2024-10-24 01:19:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:52,382 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 700 transitions. [2024-10-24 01:19:52,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 700 transitions. [2024-10-24 01:19:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 01:19:52,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:52,386 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] [2024-10-24 01:19:52,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:19:52,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:52,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash -691140561, now seen corresponding path program 1 times [2024-10-24 01:19:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721917735] [2024-10-24 01:19:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:52,606 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-24 01:19:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:52,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721917735] [2024-10-24 01:19:52,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721917735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:52,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050594248] [2024-10-24 01:19:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:52,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:52,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:52,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:52,612 INFO L87 Difference]: Start difference. First operand 435 states and 700 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-24 01:19:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:52,801 INFO L93 Difference]: Finished difference Result 1863 states and 3090 transitions. [2024-10-24 01:19:52,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:19:52,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-24 01:19:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:52,810 INFO L225 Difference]: With dead ends: 1863 [2024-10-24 01:19:52,811 INFO L226 Difference]: Without dead ends: 1477 [2024-10-24 01:19:52,813 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-24 01:19:52,814 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 695 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:52,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 983 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2024-10-24 01:19:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 772. [2024-10-24 01:19:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 1.6264591439688716) internal successors, (1254), 771 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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-24 01:19:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1254 transitions. [2024-10-24 01:19:52,857 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1254 transitions. Word has length 60 [2024-10-24 01:19:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:52,858 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1254 transitions. [2024-10-24 01:19:52,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-24 01:19:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1254 transitions. [2024-10-24 01:19:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 01:19:52,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:52,861 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] [2024-10-24 01:19:52,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:19:52,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:52,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash -13242013, now seen corresponding path program 1 times [2024-10-24 01:19:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:52,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436570832] [2024-10-24 01:19:52,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:53,000 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-24 01:19:53,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:53,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436570832] [2024-10-24 01:19:53,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436570832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:53,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:53,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603283799] [2024-10-24 01:19:53,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:53,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:53,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:53,002 INFO L87 Difference]: Start difference. First operand 772 states and 1254 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-24 01:19:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:53,104 INFO L93 Difference]: Finished difference Result 2257 states and 3733 transitions. [2024-10-24 01:19:53,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:53,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-24 01:19:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:53,112 INFO L225 Difference]: With dead ends: 2257 [2024-10-24 01:19:53,112 INFO L226 Difference]: Without dead ends: 1534 [2024-10-24 01:19:53,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:53,115 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 305 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:53,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 560 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-10-24 01:19:53,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1144. [2024-10-24 01:19:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.636920384951881) internal successors, (1871), 1143 states have internal predecessors, (1871), 0 states have call successors, (0), 0 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-24 01:19:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1871 transitions. [2024-10-24 01:19:53,154 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1871 transitions. Word has length 61 [2024-10-24 01:19:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:53,156 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1871 transitions. [2024-10-24 01:19:53,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-24 01:19:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1871 transitions. [2024-10-24 01:19:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 01:19:53,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:53,158 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] [2024-10-24 01:19:53,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:19:53,158 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:53,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash -467771752, now seen corresponding path program 1 times [2024-10-24 01:19:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218338878] [2024-10-24 01:19:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:53,331 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-24 01:19:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218338878] [2024-10-24 01:19:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218338878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:53,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:53,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177754974] [2024-10-24 01:19:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:53,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:53,333 INFO L87 Difference]: Start difference. First operand 1144 states and 1871 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-24 01:19:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:53,430 INFO L93 Difference]: Finished difference Result 3325 states and 5491 transitions. [2024-10-24 01:19:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:53,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-24 01:19:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:53,440 INFO L225 Difference]: With dead ends: 3325 [2024-10-24 01:19:53,440 INFO L226 Difference]: Without dead ends: 2230 [2024-10-24 01:19:53,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:53,443 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 305 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:53,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 520 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2024-10-24 01:19:53,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1675. [2024-10-24 01:19:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.6356033452807646) internal successors, (2738), 1674 states have internal predecessors, (2738), 0 states have call successors, (0), 0 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-24 01:19:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2738 transitions. [2024-10-24 01:19:53,500 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2738 transitions. Word has length 62 [2024-10-24 01:19:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:53,500 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2738 transitions. [2024-10-24 01:19:53,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-24 01:19:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2738 transitions. [2024-10-24 01:19:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:19:53,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:53,502 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] [2024-10-24 01:19:53,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:19:53,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:53,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash -883755154, now seen corresponding path program 1 times [2024-10-24 01:19:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:53,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511826927] [2024-10-24 01:19:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:53,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:53,590 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-24 01:19:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511826927] [2024-10-24 01:19:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511826927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:53,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:53,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:53,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45089480] [2024-10-24 01:19:53,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:53,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:53,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:53,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:53,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:53,594 INFO L87 Difference]: Start difference. First operand 1675 states and 2738 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:53,646 INFO L93 Difference]: Finished difference Result 3502 states and 5726 transitions. [2024-10-24 01:19:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:53,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 01:19:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:53,657 INFO L225 Difference]: With dead ends: 3502 [2024-10-24 01:19:53,657 INFO L226 Difference]: Without dead ends: 2520 [2024-10-24 01:19:53,659 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-24 01:19:53,661 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 77 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:53,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 363 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2024-10-24 01:19:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2518. [2024-10-24 01:19:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2517 states have (on average 1.6170043702820818) internal successors, (4070), 2517 states have internal predecessors, (4070), 0 states have call successors, (0), 0 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-24 01:19:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 4070 transitions. [2024-10-24 01:19:53,747 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 4070 transitions. Word has length 63 [2024-10-24 01:19:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:53,748 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 4070 transitions. [2024-10-24 01:19:53,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 4070 transitions. [2024-10-24 01:19:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:19:53,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:53,749 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] [2024-10-24 01:19:53,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:19:53,749 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:53,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:53,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1667840020, now seen corresponding path program 1 times [2024-10-24 01:19:53,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:53,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844989082] [2024-10-24 01:19:53,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:53,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:53,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844989082] [2024-10-24 01:19:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844989082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:53,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:53,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955793988] [2024-10-24 01:19:53,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:53,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:53,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:53,857 INFO L87 Difference]: Start difference. First operand 2518 states and 4070 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:53,987 INFO L93 Difference]: Finished difference Result 7596 states and 12391 transitions. [2024-10-24 01:19:53,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:53,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 01:19:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:54,007 INFO L225 Difference]: With dead ends: 7596 [2024-10-24 01:19:54,008 INFO L226 Difference]: Without dead ends: 5238 [2024-10-24 01:19:54,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:54,015 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 303 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:54,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 559 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2024-10-24 01:19:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 3862. [2024-10-24 01:19:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3861 states have (on average 1.615125615125615) internal successors, (6236), 3861 states have internal predecessors, (6236), 0 states have call successors, (0), 0 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-24 01:19:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 6236 transitions. [2024-10-24 01:19:54,168 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 6236 transitions. Word has length 63 [2024-10-24 01:19:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:54,168 INFO L471 AbstractCegarLoop]: Abstraction has 3862 states and 6236 transitions. [2024-10-24 01:19:54,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 6236 transitions. [2024-10-24 01:19:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:19:54,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:54,170 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] [2024-10-24 01:19:54,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:19:54,171 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:54,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1705470815, now seen corresponding path program 1 times [2024-10-24 01:19:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540503636] [2024-10-24 01:19:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:54,238 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-24 01:19:54,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540503636] [2024-10-24 01:19:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540503636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:54,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718312597] [2024-10-24 01:19:54,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:54,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:54,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:54,240 INFO L87 Difference]: Start difference. First operand 3862 states and 6236 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:54,333 INFO L93 Difference]: Finished difference Result 8546 states and 13858 transitions. [2024-10-24 01:19:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:54,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 01:19:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:54,353 INFO L225 Difference]: With dead ends: 8546 [2024-10-24 01:19:54,353 INFO L226 Difference]: Without dead ends: 5803 [2024-10-24 01:19:54,359 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-24 01:19:54,360 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 83 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:54,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5803 states. [2024-10-24 01:19:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5803 to 5801. [2024-10-24 01:19:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5801 states, 5800 states have (on average 1.6043103448275862) internal successors, (9305), 5800 states have internal predecessors, (9305), 0 states have call successors, (0), 0 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-24 01:19:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5801 states to 5801 states and 9305 transitions. [2024-10-24 01:19:54,582 INFO L78 Accepts]: Start accepts. Automaton has 5801 states and 9305 transitions. Word has length 63 [2024-10-24 01:19:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:54,582 INFO L471 AbstractCegarLoop]: Abstraction has 5801 states and 9305 transitions. [2024-10-24 01:19:54,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5801 states and 9305 transitions. [2024-10-24 01:19:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:19:54,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:54,583 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] [2024-10-24 01:19:54,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:19:54,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:54,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash 710370960, now seen corresponding path program 1 times [2024-10-24 01:19:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:54,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768833332] [2024-10-24 01:19:54,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:54,642 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-24 01:19:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768833332] [2024-10-24 01:19:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768833332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:54,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094242558] [2024-10-24 01:19:54,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:54,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:54,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:54,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:54,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:54,645 INFO L87 Difference]: Start difference. First operand 5801 states and 9305 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:54,795 INFO L93 Difference]: Finished difference Result 13147 states and 21344 transitions. [2024-10-24 01:19:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:54,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 01:19:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:54,834 INFO L225 Difference]: With dead ends: 13147 [2024-10-24 01:19:54,834 INFO L226 Difference]: Without dead ends: 8868 [2024-10-24 01:19:54,845 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-24 01:19:54,846 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 89 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:54,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 400 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8868 states. [2024-10-24 01:19:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8868 to 8866. [2024-10-24 01:19:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8866 states, 8865 states have (on average 1.5994359842075578) internal successors, (14179), 8865 states have internal predecessors, (14179), 0 states have call successors, (0), 0 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-24 01:19:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8866 states to 8866 states and 14179 transitions. [2024-10-24 01:19:55,100 INFO L78 Accepts]: Start accepts. Automaton has 8866 states and 14179 transitions. Word has length 63 [2024-10-24 01:19:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:55,100 INFO L471 AbstractCegarLoop]: Abstraction has 8866 states and 14179 transitions. [2024-10-24 01:19:55,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 8866 states and 14179 transitions. [2024-10-24 01:19:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 01:19:55,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:55,102 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] [2024-10-24 01:19:55,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:19:55,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:55,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2047190676, now seen corresponding path program 1 times [2024-10-24 01:19:55,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:55,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897871567] [2024-10-24 01:19:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:55,372 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-24 01:19:55,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897871567] [2024-10-24 01:19:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897871567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:55,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:55,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:55,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676789594] [2024-10-24 01:19:55,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:55,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:55,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:55,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:55,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:55,375 INFO L87 Difference]: Start difference. First operand 8866 states and 14179 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-24 01:19:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:55,564 INFO L93 Difference]: Finished difference Result 17671 states and 28274 transitions. [2024-10-24 01:19:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:55,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-24 01:19:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:55,582 INFO L225 Difference]: With dead ends: 17671 [2024-10-24 01:19:55,582 INFO L226 Difference]: Without dead ends: 8868 [2024-10-24 01:19:55,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:19:55,595 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 157 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:55,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 461 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8868 states. [2024-10-24 01:19:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8868 to 8866. [2024-10-24 01:19:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8866 states, 8865 states have (on average 1.585335589396503) internal successors, (14054), 8865 states have internal predecessors, (14054), 0 states have call successors, (0), 0 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-24 01:19:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8866 states to 8866 states and 14054 transitions. [2024-10-24 01:19:55,851 INFO L78 Accepts]: Start accepts. Automaton has 8866 states and 14054 transitions. Word has length 65 [2024-10-24 01:19:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:55,852 INFO L471 AbstractCegarLoop]: Abstraction has 8866 states and 14054 transitions. [2024-10-24 01:19:55,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-24 01:19:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8866 states and 14054 transitions. [2024-10-24 01:19:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 01:19:55,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:55,853 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] [2024-10-24 01:19:55,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:19:55,853 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2143907659, now seen corresponding path program 1 times [2024-10-24 01:19:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053149224] [2024-10-24 01:19:55,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:55,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:56,058 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-24 01:19:56,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:56,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053149224] [2024-10-24 01:19:56,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053149224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:56,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:56,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:56,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613579520] [2024-10-24 01:19:56,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:56,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:56,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:56,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:56,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:56,061 INFO L87 Difference]: Start difference. First operand 8866 states and 14054 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-24 01:19:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:56,413 INFO L93 Difference]: Finished difference Result 25421 states and 40446 transitions. [2024-10-24 01:19:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:56,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-24 01:19:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:56,452 INFO L225 Difference]: With dead ends: 25421 [2024-10-24 01:19:56,453 INFO L226 Difference]: Without dead ends: 16618 [2024-10-24 01:19:56,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:19:56,471 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 153 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:56,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 465 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16618 states. [2024-10-24 01:19:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16618 to 16616. [2024-10-24 01:19:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16616 states, 16615 states have (on average 1.57008727053867) internal successors, (26087), 16615 states have internal predecessors, (26087), 0 states have call successors, (0), 0 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-24 01:19:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16616 states to 16616 states and 26087 transitions. [2024-10-24 01:19:56,921 INFO L78 Accepts]: Start accepts. Automaton has 16616 states and 26087 transitions. Word has length 68 [2024-10-24 01:19:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:56,921 INFO L471 AbstractCegarLoop]: Abstraction has 16616 states and 26087 transitions. [2024-10-24 01:19:56,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-24 01:19:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 16616 states and 26087 transitions. [2024-10-24 01:19:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:19:56,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:56,922 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] [2024-10-24 01:19:56,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:19:56,923 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:56,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2051147253, now seen corresponding path program 1 times [2024-10-24 01:19:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:56,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380745229] [2024-10-24 01:19:56,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:57,104 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-24 01:19:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380745229] [2024-10-24 01:19:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380745229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:57,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:57,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503361583] [2024-10-24 01:19:57,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:57,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:57,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:57,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:57,106 INFO L87 Difference]: Start difference. First operand 16616 states and 26087 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-24 01:19:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:57,337 INFO L93 Difference]: Finished difference Result 17342 states and 27174 transitions. [2024-10-24 01:19:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:57,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-24 01:19:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:57,371 INFO L225 Difference]: With dead ends: 17342 [2024-10-24 01:19:57,371 INFO L226 Difference]: Without dead ends: 17340 [2024-10-24 01:19:57,379 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-24 01:19:57,381 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:57,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17340 states. [2024-10-24 01:19:57,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17340 to 17340. [2024-10-24 01:19:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17340 states, 17339 states have (on average 1.545763884883788) internal successors, (26802), 17339 states have internal predecessors, (26802), 0 states have call successors, (0), 0 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-24 01:19:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17340 states to 17340 states and 26802 transitions. [2024-10-24 01:19:57,791 INFO L78 Accepts]: Start accepts. Automaton has 17340 states and 26802 transitions. Word has length 69 [2024-10-24 01:19:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:57,791 INFO L471 AbstractCegarLoop]: Abstraction has 17340 states and 26802 transitions. [2024-10-24 01:19:57,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-24 01:19:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 17340 states and 26802 transitions. [2024-10-24 01:19:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:19:57,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:57,793 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:57,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:19:57,793 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:57,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:57,794 INFO L85 PathProgramCache]: Analyzing trace with hash -180411799, now seen corresponding path program 1 times [2024-10-24 01:19:57,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:57,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129571607] [2024-10-24 01:19:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:19:57,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:57,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129571607] [2024-10-24 01:19:57,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129571607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:57,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:57,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:57,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462669153] [2024-10-24 01:19:57,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:57,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:57,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:57,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:57,876 INFO L87 Difference]: Start difference. First operand 17340 states and 26802 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-24 01:19:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:58,416 INFO L93 Difference]: Finished difference Result 51777 states and 79958 transitions. [2024-10-24 01:19:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 95 [2024-10-24 01:19:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:58,493 INFO L225 Difference]: With dead ends: 51777 [2024-10-24 01:19:58,494 INFO L226 Difference]: Without dead ends: 34491 [2024-10-24 01:19:58,524 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-24 01:19:58,524 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 110 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:58,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 389 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34491 states. [2024-10-24 01:19:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34491 to 34489. [2024-10-24 01:19:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34489 states, 34488 states have (on average 1.5312282533054975) internal successors, (52809), 34488 states have internal predecessors, (52809), 0 states have call successors, (0), 0 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-24 01:19:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34489 states to 34489 states and 52809 transitions. [2024-10-24 01:19:59,298 INFO L78 Accepts]: Start accepts. Automaton has 34489 states and 52809 transitions. Word has length 95 [2024-10-24 01:19:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:59,299 INFO L471 AbstractCegarLoop]: Abstraction has 34489 states and 52809 transitions. [2024-10-24 01:19:59,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-24 01:19:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 34489 states and 52809 transitions. [2024-10-24 01:19:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:19:59,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:59,302 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:59,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:19:59,303 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:59,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1886153126, now seen corresponding path program 1 times [2024-10-24 01:19:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:59,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86275264] [2024-10-24 01:19:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:19:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:59,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86275264] [2024-10-24 01:19:59,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86275264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:59,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:59,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:59,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841322917] [2024-10-24 01:19:59,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:59,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:59,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:59,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:59,394 INFO L87 Difference]: Start difference. First operand 34489 states and 52809 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-24 01:20:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:00,262 INFO L93 Difference]: Finished difference Result 102999 states and 157563 transitions. [2024-10-24 01:20:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:00,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 95 [2024-10-24 01:20:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:00,427 INFO L225 Difference]: With dead ends: 102999 [2024-10-24 01:20:00,427 INFO L226 Difference]: Without dead ends: 68600 [2024-10-24 01:20:00,468 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-24 01:20:00,469 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 96 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:00,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 374 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68600 states. [2024-10-24 01:20:01,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68600 to 68598. [2024-10-24 01:20:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68598 states, 68597 states have (on average 1.5165240462410892) internal successors, (104029), 68597 states have internal predecessors, (104029), 0 states have call successors, (0), 0 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-24 01:20:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68598 states to 68598 states and 104029 transitions. [2024-10-24 01:20:02,258 INFO L78 Accepts]: Start accepts. Automaton has 68598 states and 104029 transitions. Word has length 95 [2024-10-24 01:20:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:02,259 INFO L471 AbstractCegarLoop]: Abstraction has 68598 states and 104029 transitions. [2024-10-24 01:20:02,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-24 01:20:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 68598 states and 104029 transitions. [2024-10-24 01:20:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:20:02,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:02,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:02,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:20:02,268 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:02,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1413714315, now seen corresponding path program 1 times [2024-10-24 01:20:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:02,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169809496] [2024-10-24 01:20:02,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169809496] [2024-10-24 01:20:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169809496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:02,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686303945] [2024-10-24 01:20:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:02,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:02,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:02,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:02,362 INFO L87 Difference]: Start difference. First operand 68598 states and 104029 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-24 01:20:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:03,881 INFO L93 Difference]: Finished difference Result 204906 states and 310457 transitions. [2024-10-24 01:20:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:03,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-24 01:20:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:04,202 INFO L225 Difference]: With dead ends: 204906 [2024-10-24 01:20:04,202 INFO L226 Difference]: Without dead ends: 136480 [2024-10-24 01:20:04,424 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-24 01:20:04,425 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 111 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:04,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 388 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136480 states. [2024-10-24 01:20:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136480 to 136478. [2024-10-24 01:20:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136478 states, 136477 states have (on average 1.5017255654798978) internal successors, (204951), 136477 states have internal predecessors, (204951), 0 states have call successors, (0), 0 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-24 01:20:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136478 states to 136478 states and 204951 transitions. [2024-10-24 01:20:07,274 INFO L78 Accepts]: Start accepts. Automaton has 136478 states and 204951 transitions. Word has length 95 [2024-10-24 01:20:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:07,275 INFO L471 AbstractCegarLoop]: Abstraction has 136478 states and 204951 transitions. [2024-10-24 01:20:07,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-24 01:20:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 136478 states and 204951 transitions. [2024-10-24 01:20:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:20:07,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:07,285 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:07,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:20:07,285 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:07,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1398195597, now seen corresponding path program 1 times [2024-10-24 01:20:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:07,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252722953] [2024-10-24 01:20:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:07,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:07,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:07,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252722953] [2024-10-24 01:20:07,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252722953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:07,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:07,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:07,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373553520] [2024-10-24 01:20:07,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:07,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:07,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:07,392 INFO L87 Difference]: Start difference. First operand 136478 states and 204951 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-24 01:20:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:10,572 INFO L93 Difference]: Finished difference Result 407686 states and 611662 transitions. [2024-10-24 01:20:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:10,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-24 01:20:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:11,137 INFO L225 Difference]: With dead ends: 407686 [2024-10-24 01:20:11,137 INFO L226 Difference]: Without dead ends: 271560 [2024-10-24 01:20:11,250 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-24 01:20:11,251 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:11,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 405 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271560 states. [2024-10-24 01:20:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271560 to 271558. [2024-10-24 01:20:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271558 states, 271557 states have (on average 1.4868333351745675) internal successors, (403760), 271557 states have internal predecessors, (403760), 0 states have call successors, (0), 0 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-24 01:20:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271558 states to 271558 states and 403760 transitions. [2024-10-24 01:20:17,457 INFO L78 Accepts]: Start accepts. Automaton has 271558 states and 403760 transitions. Word has length 95 [2024-10-24 01:20:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:17,458 INFO L471 AbstractCegarLoop]: Abstraction has 271558 states and 403760 transitions. [2024-10-24 01:20:17,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-24 01:20:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 271558 states and 403760 transitions. [2024-10-24 01:20:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:20:17,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:17,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:17,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:20:17,505 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:17,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:17,506 INFO L85 PathProgramCache]: Analyzing trace with hash 500802319, now seen corresponding path program 1 times [2024-10-24 01:20:17,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634347817] [2024-10-24 01:20:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:17,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634347817] [2024-10-24 01:20:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634347817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:17,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:17,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:17,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135073509] [2024-10-24 01:20:17,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:17,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:17,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:17,645 INFO L87 Difference]: Start difference. First operand 271558 states and 403760 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-24 01:20:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:21,021 INFO L93 Difference]: Finished difference Result 408014 states and 605322 transitions. [2024-10-24 01:20:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-24 01:20:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:21,516 INFO L225 Difference]: With dead ends: 408014 [2024-10-24 01:20:21,516 INFO L226 Difference]: Without dead ends: 271856 [2024-10-24 01:20:21,598 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-24 01:20:21,599 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 101 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:21,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 442 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271856 states. [2024-10-24 01:20:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271856 to 271854. [2024-10-24 01:20:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271854 states, 271853 states have (on average 1.474046635497861) internal successors, (400724), 271853 states have internal predecessors, (400724), 0 states have call successors, (0), 0 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-24 01:20:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271854 states to 271854 states and 400724 transitions. [2024-10-24 01:20:27,566 INFO L78 Accepts]: Start accepts. Automaton has 271854 states and 400724 transitions. Word has length 95 [2024-10-24 01:20:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:27,567 INFO L471 AbstractCegarLoop]: Abstraction has 271854 states and 400724 transitions. [2024-10-24 01:20:27,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-24 01:20:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 271854 states and 400724 transitions. [2024-10-24 01:20:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:20:27,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:27,581 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:27,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:20:27,581 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:27,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:27,582 INFO L85 PathProgramCache]: Analyzing trace with hash -510314931, now seen corresponding path program 1 times [2024-10-24 01:20:27,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:27,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411749273] [2024-10-24 01:20:27,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:27,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:27,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:27,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411749273] [2024-10-24 01:20:27,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411749273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:27,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:27,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:27,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211860393] [2024-10-24 01:20:27,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:27,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:27,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:27,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:27,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:27,662 INFO L87 Difference]: Start difference. First operand 271854 states and 400724 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-24 01:20:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:30,828 INFO L93 Difference]: Finished difference Result 408486 states and 600809 transitions. [2024-10-24 01:20:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-24 01:20:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:31,697 INFO L225 Difference]: With dead ends: 408486 [2024-10-24 01:20:31,698 INFO L226 Difference]: Without dead ends: 272360 [2024-10-24 01:20:31,781 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-24 01:20:31,782 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 115 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:31,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 460 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272360 states. [2024-10-24 01:20:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272360 to 272358. [2024-10-24 01:20:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272358 states, 272357 states have (on average 1.461078657791061) internal successors, (397935), 272357 states have internal predecessors, (397935), 0 states have call successors, (0), 0 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-24 01:20:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272358 states to 272358 states and 397935 transitions. [2024-10-24 01:20:37,146 INFO L78 Accepts]: Start accepts. Automaton has 272358 states and 397935 transitions. Word has length 95 [2024-10-24 01:20:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:37,146 INFO L471 AbstractCegarLoop]: Abstraction has 272358 states and 397935 transitions. [2024-10-24 01:20:37,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-24 01:20:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 272358 states and 397935 transitions. [2024-10-24 01:20:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:20:37,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:37,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:37,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:20:37,161 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:37,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1319661557, now seen corresponding path program 1 times [2024-10-24 01:20:37,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776737008] [2024-10-24 01:20:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:20:37,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:37,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776737008] [2024-10-24 01:20:37,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776737008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:37,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:37,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:20:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586721251] [2024-10-24 01:20:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:37,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:20:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:20:37,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:20:37,292 INFO L87 Difference]: Start difference. First operand 272358 states and 397935 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)