./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9475964eaf3c99c585f18d5c2e0c0a26c1a8a589a644152df77fbb74995f4153 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:31:04,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:31:04,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:31:04,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:31:04,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:31:04,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:31:04,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:31:04,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:31:04,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:31:04,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:31:04,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:31:04,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:31:04,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:31:04,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:31:04,721 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:31:04,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:31:04,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:31:04,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:31:04,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:31:04,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:31:04,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:31:04,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:31:04,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:31:04,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:31:04,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:31:04,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:31:04,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:31:04,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:31:04,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:31:04,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:31:04,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:31:04,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:31:04,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:31:04,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:31:04,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:31:04,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:31:04,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:31:04,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:31:04,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:31:04,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:31:04,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:31:04,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:31:04,732 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 -> 9475964eaf3c99c585f18d5c2e0c0a26c1a8a589a644152df77fbb74995f4153 [2024-10-12 20:31:04,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:31:04,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:31:04,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:31:04,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:31:04,993 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:31:04,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:31:06,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:31:06,615 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:31:06,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:31:06,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7586c08/fe366229c94240bd9a7e9c5bd400d966/FLAG20cc9aae5 [2024-10-12 20:31:06,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7586c08/fe366229c94240bd9a7e9c5bd400d966 [2024-10-12 20:31:06,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:31:06,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:31:06,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:31:06,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:31:06,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:31:06,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:31:06" (1/1) ... [2024-10-12 20:31:06,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366ba63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:06, skipping insertion in model container [2024-10-12 20:31:06,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:31:06" (1/1) ... [2024-10-12 20:31:06,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:31:06,941 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6732,6745] [2024-10-12 20:31:06,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:31:06,979 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:31:07,027 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6732,6745] [2024-10-12 20:31:07,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:31:07,076 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:31:07,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07 WrapperNode [2024-10-12 20:31:07,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:31:07,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:31:07,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:31:07,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:31:07,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,153 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 537 [2024-10-12 20:31:07,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:31:07,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:31:07,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:31:07,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:31:07,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,212 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:31:07,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:31:07,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:31:07,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:31:07,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:31:07,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (1/1) ... [2024-10-12 20:31:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:31:07,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:31:07,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:31:07,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:31:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:31:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:31:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:31:07,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:31:07,449 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:31:07,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:31:07,851 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-12 20:31:07,851 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:31:07,921 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:31:07,922 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:31:07,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:31:07 BoogieIcfgContainer [2024-10-12 20:31:07,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:31:07,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:31:07,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:31:07,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:31:07,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:31:06" (1/3) ... [2024-10-12 20:31:07,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530c29a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:31:07, skipping insertion in model container [2024-10-12 20:31:07,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:07" (2/3) ... [2024-10-12 20:31:07,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530c29a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:31:07, skipping insertion in model container [2024-10-12 20:31:07,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:31:07" (3/3) ... [2024-10-12 20:31:07,932 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:31:07,947 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:31:07,949 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:31:07,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:31:08,001 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;@48a29da9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:31:08,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:31:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 115 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:31:08,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:08,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:08,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:08,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:08,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1168522135, now seen corresponding path program 1 times [2024-10-12 20:31:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:08,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911173413] [2024-10-12 20:31:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:08,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:08,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:08,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911173413] [2024-10-12 20:31:08,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911173413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:08,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:08,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:08,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445482291] [2024-10-12 20:31:08,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:08,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:08,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:08,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:08,493 INFO L87 Difference]: Start difference. First operand has 116 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 115 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:08,538 INFO L93 Difference]: Finished difference Result 256 states and 418 transitions. [2024-10-12 20:31:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:08,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-10-12 20:31:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:08,547 INFO L225 Difference]: With dead ends: 256 [2024-10-12 20:31:08,547 INFO L226 Difference]: Without dead ends: 178 [2024-10-12 20:31:08,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:08,553 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 132 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:08,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 395 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-12 20:31:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-10-12 20:31:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.457142857142857) internal successors, (255), 175 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2024-10-12 20:31:08,587 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 72 [2024-10-12 20:31:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:08,587 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2024-10-12 20:31:08,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2024-10-12 20:31:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:31:08,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:08,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:08,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:31:08,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:08,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash 199267447, now seen corresponding path program 1 times [2024-10-12 20:31:08,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:08,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144966139] [2024-10-12 20:31:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:08,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:08,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:08,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144966139] [2024-10-12 20:31:08,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144966139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:08,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:08,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838136640] [2024-10-12 20:31:08,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:08,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:08,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:08,735 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:08,769 INFO L93 Difference]: Finished difference Result 428 states and 655 transitions. [2024-10-12 20:31:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:08,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-12 20:31:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:08,773 INFO L225 Difference]: With dead ends: 428 [2024-10-12 20:31:08,773 INFO L226 Difference]: Without dead ends: 294 [2024-10-12 20:31:08,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:08,776 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 94 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:08,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 342 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-12 20:31:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2024-10-12 20:31:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.5085910652920962) internal successors, (439), 291 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 439 transitions. [2024-10-12 20:31:08,802 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 439 transitions. Word has length 73 [2024-10-12 20:31:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:08,802 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 439 transitions. [2024-10-12 20:31:08,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 439 transitions. [2024-10-12 20:31:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:31:08,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:08,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:08,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:31:08,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:08,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash -619794628, now seen corresponding path program 1 times [2024-10-12 20:31:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550687382] [2024-10-12 20:31:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550687382] [2024-10-12 20:31:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550687382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:08,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100328915] [2024-10-12 20:31:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:08,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:08,909 INFO L87 Difference]: Start difference. First operand 292 states and 439 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:08,933 INFO L93 Difference]: Finished difference Result 760 states and 1181 transitions. [2024-10-12 20:31:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-12 20:31:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:08,938 INFO L225 Difference]: With dead ends: 760 [2024-10-12 20:31:08,938 INFO L226 Difference]: Without dead ends: 510 [2024-10-12 20:31:08,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:08,943 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 89 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:08,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 338 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-12 20:31:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2024-10-12 20:31:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.5364891518737673) internal successors, (779), 507 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 779 transitions. [2024-10-12 20:31:08,962 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 779 transitions. Word has length 74 [2024-10-12 20:31:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:08,962 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 779 transitions. [2024-10-12 20:31:08,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 779 transitions. [2024-10-12 20:31:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:31:08,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:08,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:08,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:31:08,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:08,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash -544666826, now seen corresponding path program 1 times [2024-10-12 20:31:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:08,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804492633] [2024-10-12 20:31:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:09,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804492633] [2024-10-12 20:31:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804492633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:09,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:09,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:09,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649168191] [2024-10-12 20:31:09,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:09,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:09,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:09,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:09,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:09,048 INFO L87 Difference]: Start difference. First operand 508 states and 779 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:09,068 INFO L93 Difference]: Finished difference Result 1376 states and 2149 transitions. [2024-10-12 20:31:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:09,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-12 20:31:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:09,089 INFO L225 Difference]: With dead ends: 1376 [2024-10-12 20:31:09,089 INFO L226 Difference]: Without dead ends: 910 [2024-10-12 20:31:09,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:09,093 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 84 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:09,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 334 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-10-12 20:31:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 908. [2024-10-12 20:31:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 1.5468577728776185) internal successors, (1403), 907 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1403 transitions. [2024-10-12 20:31:09,112 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1403 transitions. Word has length 75 [2024-10-12 20:31:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:09,113 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1403 transitions. [2024-10-12 20:31:09,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1403 transitions. [2024-10-12 20:31:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:31:09,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:09,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:09,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:31:09,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:09,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:09,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1064989273, now seen corresponding path program 1 times [2024-10-12 20:31:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:09,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076810484] [2024-10-12 20:31:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076810484] [2024-10-12 20:31:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076810484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:09,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233386484] [2024-10-12 20:31:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:09,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:09,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:09,214 INFO L87 Difference]: Start difference. First operand 908 states and 1403 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:09,235 INFO L93 Difference]: Finished difference Result 2512 states and 3917 transitions. [2024-10-12 20:31:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-12 20:31:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:09,240 INFO L225 Difference]: With dead ends: 2512 [2024-10-12 20:31:09,241 INFO L226 Difference]: Without dead ends: 1646 [2024-10-12 20:31:09,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:09,243 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 79 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:09,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 330 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2024-10-12 20:31:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1644. [2024-10-12 20:31:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1643 states have (on average 1.5453438831405966) internal successors, (2539), 1643 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2539 transitions. [2024-10-12 20:31:09,274 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2539 transitions. Word has length 76 [2024-10-12 20:31:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:09,274 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2539 transitions. [2024-10-12 20:31:09,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2539 transitions. [2024-10-12 20:31:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:31:09,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:09,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:09,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:31:09,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:09,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1230877810, now seen corresponding path program 1 times [2024-10-12 20:31:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:09,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312952373] [2024-10-12 20:31:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:09,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312952373] [2024-10-12 20:31:09,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312952373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:09,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:09,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702894270] [2024-10-12 20:31:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:09,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:09,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:09,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:09,426 INFO L87 Difference]: Start difference. First operand 1644 states and 2539 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:09,809 INFO L93 Difference]: Finished difference Result 20868 states and 32503 transitions. [2024-10-12 20:31:09,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:31:09,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:31:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:09,871 INFO L225 Difference]: With dead ends: 20868 [2024-10-12 20:31:09,872 INFO L226 Difference]: Without dead ends: 19266 [2024-10-12 20:31:09,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:31:09,886 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1770 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:09,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 2901 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19266 states. [2024-10-12 20:31:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19266 to 3244. [2024-10-12 20:31:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 3243 states have (on average 1.5328399629972247) internal successors, (4971), 3243 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4971 transitions. [2024-10-12 20:31:10,113 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4971 transitions. Word has length 77 [2024-10-12 20:31:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:10,113 INFO L471 AbstractCegarLoop]: Abstraction has 3244 states and 4971 transitions. [2024-10-12 20:31:10,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4971 transitions. [2024-10-12 20:31:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:31:10,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:10,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:10,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:31:10,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:10,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash 835749454, now seen corresponding path program 1 times [2024-10-12 20:31:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:10,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413533244] [2024-10-12 20:31:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413533244] [2024-10-12 20:31:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413533244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:10,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:10,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:10,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893828746] [2024-10-12 20:31:10,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:10,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:10,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:10,259 INFO L87 Difference]: Start difference. First operand 3244 states and 4971 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:10,308 INFO L93 Difference]: Finished difference Result 9296 states and 14221 transitions. [2024-10-12 20:31:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:10,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-12 20:31:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:10,334 INFO L225 Difference]: With dead ends: 9296 [2024-10-12 20:31:10,335 INFO L226 Difference]: Without dead ends: 6094 [2024-10-12 20:31:10,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:10,345 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 69 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 260 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-12 20:31:10,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 260 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6094 states. [2024-10-12 20:31:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6094 to 6028. [2024-10-12 20:31:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6028 states, 6027 states have (on average 1.5043968807035009) internal successors, (9067), 6027 states have internal predecessors, (9067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6028 states to 6028 states and 9067 transitions. [2024-10-12 20:31:10,432 INFO L78 Accepts]: Start accepts. Automaton has 6028 states and 9067 transitions. Word has length 79 [2024-10-12 20:31:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:10,433 INFO L471 AbstractCegarLoop]: Abstraction has 6028 states and 9067 transitions. [2024-10-12 20:31:10,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6028 states and 9067 transitions. [2024-10-12 20:31:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:31:10,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:10,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:10,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:31:10,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:10,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 856752109, now seen corresponding path program 1 times [2024-10-12 20:31:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:10,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064225066] [2024-10-12 20:31:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:10,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:10,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064225066] [2024-10-12 20:31:10,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064225066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:10,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:10,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169798312] [2024-10-12 20:31:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:10,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:10,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:10,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:10,752 INFO L87 Difference]: Start difference. First operand 6028 states and 9067 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:10,987 INFO L93 Difference]: Finished difference Result 12016 states and 18093 transitions. [2024-10-12 20:31:10,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:10,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-12 20:31:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:10,996 INFO L225 Difference]: With dead ends: 12016 [2024-10-12 20:31:10,996 INFO L226 Difference]: Without dead ends: 6030 [2024-10-12 20:31:11,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:31:11,004 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 472 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:11,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 745 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2024-10-12 20:31:11,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 6028. [2024-10-12 20:31:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6028 states, 6027 states have (on average 1.49377799900448) internal successors, (9003), 6027 states have internal predecessors, (9003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6028 states to 6028 states and 9003 transitions. [2024-10-12 20:31:11,094 INFO L78 Accepts]: Start accepts. Automaton has 6028 states and 9003 transitions. Word has length 79 [2024-10-12 20:31:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:11,094 INFO L471 AbstractCegarLoop]: Abstraction has 6028 states and 9003 transitions. [2024-10-12 20:31:11,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6028 states and 9003 transitions. [2024-10-12 20:31:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 20:31:11,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:11,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:11,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:31:11,095 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:11,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:11,096 INFO L85 PathProgramCache]: Analyzing trace with hash 89483993, now seen corresponding path program 1 times [2024-10-12 20:31:11,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:11,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155765371] [2024-10-12 20:31:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:11,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:11,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155765371] [2024-10-12 20:31:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155765371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:11,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:11,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917146748] [2024-10-12 20:31:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:11,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:11,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:11,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:11,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:11,171 INFO L87 Difference]: Start difference. First operand 6028 states and 9003 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:11,202 INFO L93 Difference]: Finished difference Result 11795 states and 17777 transitions. [2024-10-12 20:31:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:11,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-12 20:31:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:11,215 INFO L225 Difference]: With dead ends: 11795 [2024-10-12 20:31:11,215 INFO L226 Difference]: Without dead ends: 8592 [2024-10-12 20:31:11,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:11,221 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 101 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:11,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 354 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8592 states. [2024-10-12 20:31:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8592 to 8590. [2024-10-12 20:31:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8590 states, 8589 states have (on average 1.491791826755152) internal successors, (12813), 8589 states have internal predecessors, (12813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8590 states to 8590 states and 12813 transitions. [2024-10-12 20:31:11,306 INFO L78 Accepts]: Start accepts. Automaton has 8590 states and 12813 transitions. Word has length 80 [2024-10-12 20:31:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:11,306 INFO L471 AbstractCegarLoop]: Abstraction has 8590 states and 12813 transitions. [2024-10-12 20:31:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 8590 states and 12813 transitions. [2024-10-12 20:31:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 20:31:11,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:11,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:11,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:31:11,308 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash 787602291, now seen corresponding path program 1 times [2024-10-12 20:31:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:11,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414988157] [2024-10-12 20:31:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:11,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:11,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414988157] [2024-10-12 20:31:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414988157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:11,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:11,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515671906] [2024-10-12 20:31:11,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:11,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:11,384 INFO L87 Difference]: Start difference. First operand 8590 states and 12813 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:11,558 INFO L93 Difference]: Finished difference Result 17136 states and 25582 transitions. [2024-10-12 20:31:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:11,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-12 20:31:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:11,578 INFO L225 Difference]: With dead ends: 17136 [2024-10-12 20:31:11,582 INFO L226 Difference]: Without dead ends: 8590 [2024-10-12 20:31:11,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:11,599 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 388 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:11,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 115 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8590 states. [2024-10-12 20:31:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8590 to 8590. [2024-10-12 20:31:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8590 states, 8589 states have (on average 1.480614739783444) internal successors, (12717), 8589 states have internal predecessors, (12717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8590 states to 8590 states and 12717 transitions. [2024-10-12 20:31:11,707 INFO L78 Accepts]: Start accepts. Automaton has 8590 states and 12717 transitions. Word has length 80 [2024-10-12 20:31:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:11,708 INFO L471 AbstractCegarLoop]: Abstraction has 8590 states and 12717 transitions. [2024-10-12 20:31:11,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8590 states and 12717 transitions. [2024-10-12 20:31:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 20:31:11,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:11,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:11,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:31:11,709 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:11,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash 24738584, now seen corresponding path program 1 times [2024-10-12 20:31:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239414874] [2024-10-12 20:31:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239414874] [2024-10-12 20:31:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239414874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:11,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:11,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035056318] [2024-10-12 20:31:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:11,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:11,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:11,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:11,803 INFO L87 Difference]: Start difference. First operand 8590 states and 12717 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:11,948 INFO L93 Difference]: Finished difference Result 17136 states and 25390 transitions. [2024-10-12 20:31:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:11,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-12 20:31:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:11,959 INFO L225 Difference]: With dead ends: 17136 [2024-10-12 20:31:11,959 INFO L226 Difference]: Without dead ends: 8590 [2024-10-12 20:31:11,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:11,967 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 359 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:11,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 131 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8590 states. [2024-10-12 20:31:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8590 to 8590. [2024-10-12 20:31:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8590 states, 8589 states have (on average 1.4694376528117359) internal successors, (12621), 8589 states have internal predecessors, (12621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8590 states to 8590 states and 12621 transitions. [2024-10-12 20:31:12,093 INFO L78 Accepts]: Start accepts. Automaton has 8590 states and 12621 transitions. Word has length 80 [2024-10-12 20:31:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:12,094 INFO L471 AbstractCegarLoop]: Abstraction has 8590 states and 12621 transitions. [2024-10-12 20:31:12,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 8590 states and 12621 transitions. [2024-10-12 20:31:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 20:31:12,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:12,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:12,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:31:12,096 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:12,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash 890270973, now seen corresponding path program 1 times [2024-10-12 20:31:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475875145] [2024-10-12 20:31:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:12,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:12,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475875145] [2024-10-12 20:31:12,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475875145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:12,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127451500] [2024-10-12 20:31:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:12,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:12,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:12,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:12,188 INFO L87 Difference]: Start difference. First operand 8590 states and 12621 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:12,288 INFO L93 Difference]: Finished difference Result 17136 states and 25198 transitions. [2024-10-12 20:31:12,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:12,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-12 20:31:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:12,299 INFO L225 Difference]: With dead ends: 17136 [2024-10-12 20:31:12,300 INFO L226 Difference]: Without dead ends: 8590 [2024-10-12 20:31:12,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:12,309 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 369 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:12,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 123 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8590 states. [2024-10-12 20:31:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8590 to 8590. [2024-10-12 20:31:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8590 states, 8589 states have (on average 1.4582605658400278) internal successors, (12525), 8589 states have internal predecessors, (12525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8590 states to 8590 states and 12525 transitions. [2024-10-12 20:31:12,421 INFO L78 Accepts]: Start accepts. Automaton has 8590 states and 12525 transitions. Word has length 80 [2024-10-12 20:31:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:12,421 INFO L471 AbstractCegarLoop]: Abstraction has 8590 states and 12525 transitions. [2024-10-12 20:31:12,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8590 states and 12525 transitions. [2024-10-12 20:31:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 20:31:12,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:12,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:12,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:31:12,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:12,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1018356280, now seen corresponding path program 1 times [2024-10-12 20:31:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:12,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975849442] [2024-10-12 20:31:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975849442] [2024-10-12 20:31:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975849442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:12,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506278181] [2024-10-12 20:31:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:12,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:12,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:12,507 INFO L87 Difference]: Start difference. First operand 8590 states and 12525 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:12,639 INFO L93 Difference]: Finished difference Result 17136 states and 25006 transitions. [2024-10-12 20:31:12,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:12,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-12 20:31:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:12,649 INFO L225 Difference]: With dead ends: 17136 [2024-10-12 20:31:12,649 INFO L226 Difference]: Without dead ends: 8590 [2024-10-12 20:31:12,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:12,655 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 392 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:12,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 107 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8590 states. [2024-10-12 20:31:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8590 to 8590. [2024-10-12 20:31:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8590 states, 8589 states have (on average 1.44708347886832) internal successors, (12429), 8589 states have internal predecessors, (12429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8590 states to 8590 states and 12429 transitions. [2024-10-12 20:31:12,730 INFO L78 Accepts]: Start accepts. Automaton has 8590 states and 12429 transitions. Word has length 80 [2024-10-12 20:31:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:12,730 INFO L471 AbstractCegarLoop]: Abstraction has 8590 states and 12429 transitions. [2024-10-12 20:31:12,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 8590 states and 12429 transitions. [2024-10-12 20:31:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 20:31:12,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:12,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:12,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:31:12,731 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:12,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1386627507, now seen corresponding path program 1 times [2024-10-12 20:31:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668367291] [2024-10-12 20:31:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668367291] [2024-10-12 20:31:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668367291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:12,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:31:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888469720] [2024-10-12 20:31:12,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:12,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:12,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:12,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:12,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:12,987 INFO L87 Difference]: Start difference. First operand 8590 states and 12429 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:13,020 INFO L93 Difference]: Finished difference Result 8848 states and 12814 transitions. [2024-10-12 20:31:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:13,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-12 20:31:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:13,031 INFO L225 Difference]: With dead ends: 8848 [2024-10-12 20:31:13,032 INFO L226 Difference]: Without dead ends: 8846 [2024-10-12 20:31:13,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:13,034 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:13,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8846 states. [2024-10-12 20:31:13,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8846 to 8846. [2024-10-12 20:31:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8846 states, 8845 states have (on average 1.4305257207461843) internal successors, (12653), 8845 states have internal predecessors, (12653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8846 states to 8846 states and 12653 transitions. [2024-10-12 20:31:13,121 INFO L78 Accepts]: Start accepts. Automaton has 8846 states and 12653 transitions. Word has length 80 [2024-10-12 20:31:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:13,121 INFO L471 AbstractCegarLoop]: Abstraction has 8846 states and 12653 transitions. [2024-10-12 20:31:13,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8846 states and 12653 transitions. [2024-10-12 20:31:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:31:13,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:13,125 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:13,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:31:13,125 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:13,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash 547687804, now seen corresponding path program 1 times [2024-10-12 20:31:13,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:13,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351302764] [2024-10-12 20:31:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 20:31:13,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351302764] [2024-10-12 20:31:13,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351302764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:13,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:13,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650963789] [2024-10-12 20:31:13,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:13,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:13,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:13,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:13,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:13,294 INFO L87 Difference]: Start difference. First operand 8846 states and 12653 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:13,507 INFO L93 Difference]: Finished difference Result 63292 states and 90580 transitions. [2024-10-12 20:31:13,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:13,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:31:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:13,586 INFO L225 Difference]: With dead ends: 63292 [2024-10-12 20:31:13,586 INFO L226 Difference]: Without dead ends: 54490 [2024-10-12 20:31:13,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:13,607 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1549 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:13,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1129 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54490 states. [2024-10-12 20:31:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54490 to 17646. [2024-10-12 20:31:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17646 states, 17645 states have (on average 1.4261830546897138) internal successors, (25165), 17645 states have internal predecessors, (25165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17646 states to 17646 states and 25165 transitions. [2024-10-12 20:31:14,172 INFO L78 Accepts]: Start accepts. Automaton has 17646 states and 25165 transitions. Word has length 111 [2024-10-12 20:31:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:14,172 INFO L471 AbstractCegarLoop]: Abstraction has 17646 states and 25165 transitions. [2024-10-12 20:31:14,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 17646 states and 25165 transitions. [2024-10-12 20:31:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:31:14,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:14,180 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:14,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:31:14,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:14,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1176854258, now seen corresponding path program 1 times [2024-10-12 20:31:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:14,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257916546] [2024-10-12 20:31:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 20:31:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:14,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257916546] [2024-10-12 20:31:14,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257916546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:14,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:14,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:14,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269667168] [2024-10-12 20:31:14,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:14,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:14,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:14,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:14,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:14,446 INFO L87 Difference]: Start difference. First operand 17646 states and 25165 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:14,774 INFO L93 Difference]: Finished difference Result 72092 states and 103092 transitions. [2024-10-12 20:31:14,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:14,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:31:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:15,001 INFO L225 Difference]: With dead ends: 72092 [2024-10-12 20:31:15,001 INFO L226 Difference]: Without dead ends: 63290 [2024-10-12 20:31:15,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:15,025 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1438 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:15,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 1194 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63290 states. [2024-10-12 20:31:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63290 to 30862. [2024-10-12 20:31:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30862 states, 30861 states have (on average 1.420984413985289) internal successors, (43853), 30861 states have internal predecessors, (43853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30862 states to 30862 states and 43853 transitions. [2024-10-12 20:31:15,644 INFO L78 Accepts]: Start accepts. Automaton has 30862 states and 43853 transitions. Word has length 111 [2024-10-12 20:31:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:15,645 INFO L471 AbstractCegarLoop]: Abstraction has 30862 states and 43853 transitions. [2024-10-12 20:31:15,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 30862 states and 43853 transitions. [2024-10-12 20:31:15,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:31:15,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:15,649 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:15,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:31:15,650 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:15,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash -22908152, now seen corresponding path program 1 times [2024-10-12 20:31:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801176568] [2024-10-12 20:31:15,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 20:31:15,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:15,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801176568] [2024-10-12 20:31:15,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801176568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:15,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:15,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:15,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840021656] [2024-10-12 20:31:15,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:15,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:15,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:15,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:15,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:15,931 INFO L87 Difference]: Start difference. First operand 30862 states and 43853 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:16,268 INFO L93 Difference]: Finished difference Result 80892 states and 115604 transitions. [2024-10-12 20:31:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:31:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:16,357 INFO L225 Difference]: With dead ends: 80892 [2024-10-12 20:31:16,357 INFO L226 Difference]: Without dead ends: 72090 [2024-10-12 20:31:16,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:16,385 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1272 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:16,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 1250 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72090 states. [2024-10-12 20:31:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72090 to 39662. [2024-10-12 20:31:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39662 states, 39661 states have (on average 1.4211694107561585) internal successors, (56365), 39661 states have internal predecessors, (56365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39662 states to 39662 states and 56365 transitions. [2024-10-12 20:31:17,380 INFO L78 Accepts]: Start accepts. Automaton has 39662 states and 56365 transitions. Word has length 111 [2024-10-12 20:31:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:17,380 INFO L471 AbstractCegarLoop]: Abstraction has 39662 states and 56365 transitions. [2024-10-12 20:31:17,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 39662 states and 56365 transitions. [2024-10-12 20:31:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:31:17,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:17,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:17,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:31:17,397 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:17,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash -880808830, now seen corresponding path program 1 times [2024-10-12 20:31:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:17,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313756622] [2024-10-12 20:31:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 20:31:17,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313756622] [2024-10-12 20:31:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313756622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084442043] [2024-10-12 20:31:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:17,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:17,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:17,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:17,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:17,690 INFO L87 Difference]: Start difference. First operand 39662 states and 56365 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:18,096 INFO L93 Difference]: Finished difference Result 89692 states and 128116 transitions. [2024-10-12 20:31:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:18,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:31:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:18,189 INFO L225 Difference]: With dead ends: 89692 [2024-10-12 20:31:18,189 INFO L226 Difference]: Without dead ends: 80890 [2024-10-12 20:31:18,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:18,220 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1267 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:18,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 1350 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80890 states. [2024-10-12 20:31:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80890 to 48462. [2024-10-12 20:31:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48462 states, 48461 states have (on average 1.421287220651658) internal successors, (68877), 48461 states have internal predecessors, (68877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48462 states to 48462 states and 68877 transitions. [2024-10-12 20:31:19,211 INFO L78 Accepts]: Start accepts. Automaton has 48462 states and 68877 transitions. Word has length 111 [2024-10-12 20:31:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:19,211 INFO L471 AbstractCegarLoop]: Abstraction has 48462 states and 68877 transitions. [2024-10-12 20:31:19,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 48462 states and 68877 transitions. [2024-10-12 20:31:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:31:19,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:19,217 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:19,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:31:19,217 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:19,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1771842058, now seen corresponding path program 1 times [2024-10-12 20:31:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048865070] [2024-10-12 20:31:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:19,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 20:31:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:19,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048865070] [2024-10-12 20:31:19,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048865070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:19,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:19,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:19,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411090696] [2024-10-12 20:31:19,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:19,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:19,349 INFO L87 Difference]: Start difference. First operand 48462 states and 68877 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:19,971 INFO L93 Difference]: Finished difference Result 98492 states and 140628 transitions. [2024-10-12 20:31:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:19,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:31:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:20,106 INFO L225 Difference]: With dead ends: 98492 [2024-10-12 20:31:20,107 INFO L226 Difference]: Without dead ends: 89690 [2024-10-12 20:31:20,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:20,140 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1371 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:20,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 1459 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89690 states. [2024-10-12 20:31:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89690 to 57262. [2024-10-12 20:31:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57262 states, 57261 states have (on average 1.421368819964723) internal successors, (81389), 57261 states have internal predecessors, (81389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57262 states to 57262 states and 81389 transitions. [2024-10-12 20:31:21,442 INFO L78 Accepts]: Start accepts. Automaton has 57262 states and 81389 transitions. Word has length 111 [2024-10-12 20:31:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:21,443 INFO L471 AbstractCegarLoop]: Abstraction has 57262 states and 81389 transitions. [2024-10-12 20:31:21,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 57262 states and 81389 transitions. [2024-10-12 20:31:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:31:21,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:21,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:21,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:31:21,452 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:21,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash -721790003, now seen corresponding path program 1 times [2024-10-12 20:31:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:21,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277158405] [2024-10-12 20:31:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:31:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277158405] [2024-10-12 20:31:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277158405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:21,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:21,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864284176] [2024-10-12 20:31:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:21,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:21,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:21,704 INFO L87 Difference]: Start difference. First operand 57262 states and 81389 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:22,177 INFO L93 Difference]: Finished difference Result 101724 states and 145332 transitions. [2024-10-12 20:31:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:22,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-12 20:31:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:22,299 INFO L225 Difference]: With dead ends: 101724 [2024-10-12 20:31:22,300 INFO L226 Difference]: Without dead ends: 95706 [2024-10-12 20:31:22,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:22,339 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1370 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:22,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 1313 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95706 states. [2024-10-12 20:31:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95706 to 63278. [2024-10-12 20:31:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63278 states, 63277 states have (on average 1.422776048169161) internal successors, (90029), 63277 states have internal predecessors, (90029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63278 states to 63278 states and 90029 transitions. [2024-10-12 20:31:23,863 INFO L78 Accepts]: Start accepts. Automaton has 63278 states and 90029 transitions. Word has length 112 [2024-10-12 20:31:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:23,864 INFO L471 AbstractCegarLoop]: Abstraction has 63278 states and 90029 transitions. [2024-10-12 20:31:23,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 63278 states and 90029 transitions. [2024-10-12 20:31:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:31:23,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:23,877 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:23,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:31:23,878 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:23,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1311967558, now seen corresponding path program 1 times [2024-10-12 20:31:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637823749] [2024-10-12 20:31:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:24,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637823749] [2024-10-12 20:31:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637823749] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:31:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114935581] [2024-10-12 20:31:24,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:24,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:31:24,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:31:24,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:31:24,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:31:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:24,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 20:31:24,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:31:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:31:24,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:31:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:31:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114935581] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:31:24,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:31:24,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-12 20:31:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540654990] [2024-10-12 20:31:24,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:31:24,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 20:31:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:24,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 20:31:24,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:31:24,987 INFO L87 Difference]: Start difference. First operand 63278 states and 90029 transitions. Second operand has 18 states, 18 states have (on average 18.11111111111111) internal successors, (326), 18 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:30,664 INFO L93 Difference]: Finished difference Result 603788 states and 853900 transitions. [2024-10-12 20:31:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-10-12 20:31:30,665 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 18.11111111111111) internal successors, (326), 18 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-12 20:31:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:31,937 INFO L225 Difference]: With dead ends: 603788 [2024-10-12 20:31:31,938 INFO L226 Difference]: Without dead ends: 540554 [2024-10-12 20:31:32,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5931 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2342, Invalid=12178, Unknown=0, NotChecked=0, Total=14520 [2024-10-12 20:31:32,112 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 4830 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4830 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:32,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4830 Valid, 1594 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:31:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540554 states. [2024-10-12 20:31:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540554 to 441046. [2024-10-12 20:31:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441046 states, 441045 states have (on average 1.396422133795871) internal successors, (615885), 441045 states have internal predecessors, (615885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441046 states to 441046 states and 615885 transitions. [2024-10-12 20:31:39,930 INFO L78 Accepts]: Start accepts. Automaton has 441046 states and 615885 transitions. Word has length 113 [2024-10-12 20:31:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:39,931 INFO L471 AbstractCegarLoop]: Abstraction has 441046 states and 615885 transitions. [2024-10-12 20:31:39,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.11111111111111) internal successors, (326), 18 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 441046 states and 615885 transitions. [2024-10-12 20:31:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:31:39,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:39,946 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:39,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:31:40,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-12 20:31:40,148 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:40,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash -646359828, now seen corresponding path program 1 times [2024-10-12 20:31:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:40,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898055551] [2024-10-12 20:31:40,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:40,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:40,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898055551] [2024-10-12 20:31:40,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898055551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:40,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:40,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173896075] [2024-10-12 20:31:40,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:40,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:40,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:40,281 INFO L87 Difference]: Start difference. First operand 441046 states and 615885 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:43,007 INFO L93 Difference]: Finished difference Result 778559 states and 1086507 transitions. [2024-10-12 20:31:43,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:43,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-12 20:31:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:43,532 INFO L225 Difference]: With dead ends: 778559 [2024-10-12 20:31:43,532 INFO L226 Difference]: Without dead ends: 337557 [2024-10-12 20:31:43,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:43,735 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 69 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:43,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 336 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337557 states. [2024-10-12 20:31:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337557 to 337555. [2024-10-12 20:31:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337555 states, 337554 states have (on average 1.381725590572175) internal successors, (466407), 337554 states have internal predecessors, (466407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337555 states to 337555 states and 466407 transitions. [2024-10-12 20:31:49,088 INFO L78 Accepts]: Start accepts. Automaton has 337555 states and 466407 transitions. Word has length 113 [2024-10-12 20:31:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:49,089 INFO L471 AbstractCegarLoop]: Abstraction has 337555 states and 466407 transitions. [2024-10-12 20:31:49,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 337555 states and 466407 transitions. [2024-10-12 20:31:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 20:31:49,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:49,096 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:49,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:31:49,096 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:49,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash -843820291, now seen corresponding path program 1 times [2024-10-12 20:31:49,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:49,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679563005] [2024-10-12 20:31:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:49,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:49,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:49,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679563005] [2024-10-12 20:31:49,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679563005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:31:49,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935133466] [2024-10-12 20:31:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:49,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:31:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:31:49,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:31:49,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:31:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:49,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:31:49,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:31:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:50,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:31:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935133466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:31:51,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:31:51,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2024-10-12 20:31:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410853560] [2024-10-12 20:31:51,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:31:51,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-12 20:31:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:51,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 20:31:51,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2024-10-12 20:31:51,428 INFO L87 Difference]: Start difference. First operand 337555 states and 466407 transitions. Second operand has 27 states, 27 states have (on average 11.037037037037036) internal successors, (298), 26 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)