./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.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/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:05:33,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:05:33,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:05:33,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:05:33,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:05:33,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:05:33,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:05:33,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:05:33,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:05:33,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:05:33,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:05:33,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:05:33,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:05:33,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:05:33,793 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:05:33,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:05:33,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:05:33,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:05:33,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:05:33,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:05:33,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:05:33,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:05:33,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:05:33,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:05:33,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:05:33,801 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:05:33,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:05:33,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:05:33,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:05:33,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:05:33,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:05:33,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:05:33,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:05:33,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:05:33,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:05:33,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:05:33,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:05:33,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:05:33,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:05:33,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:05:33,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:05:33,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:05:33,805 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 -> 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 [2024-10-12 20:05:34,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:05:34,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:05:34,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:05:34,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:05:34,087 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:05:34,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2024-10-12 20:05:35,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:05:35,772 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:05:35,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2024-10-12 20:05:35,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3bad6ba0/81da4e58d94c4acabccd55ed2cc3ac75/FLAG48ca361c4 [2024-10-12 20:05:36,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3bad6ba0/81da4e58d94c4acabccd55ed2cc3ac75 [2024-10-12 20:05:36,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:05:36,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:05:36,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:05:36,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:05:36,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:05:36,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1fa554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36, skipping insertion in model container [2024-10-12 20:05:36,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:05:36,384 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2024-10-12 20:05:36,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:05:36,398 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:05:36,461 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2024-10-12 20:05:36,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:05:36,491 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:05:36,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36 WrapperNode [2024-10-12 20:05:36,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:05:36,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:05:36,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:05:36,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:05:36,502 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:05:36" (1/1) ... [2024-10-12 20:05:36,516 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:05:36" (1/1) ... [2024-10-12 20:05:36,553 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 394 [2024-10-12 20:05:36,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:05:36,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:05:36,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:05:36,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:05:36,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,596 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:05:36,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:05:36,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:05:36,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:05:36,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:05:36,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (1/1) ... [2024-10-12 20:05:36,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:05:36,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:36,676 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:05:36,679 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:05:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:05:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:05:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:05:36,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:05:36,839 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:05:36,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:05:37,332 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-12 20:05:37,333 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:05:37,422 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:05:37,423 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:05:37,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:05:37 BoogieIcfgContainer [2024-10-12 20:05:37,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:05:37,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:05:37,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:05:37,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:05:37,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:05:36" (1/3) ... [2024-10-12 20:05:37,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e60b196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:05:37, skipping insertion in model container [2024-10-12 20:05:37,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:36" (2/3) ... [2024-10-12 20:05:37,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e60b196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:05:37, skipping insertion in model container [2024-10-12 20:05:37,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:05:37" (3/3) ... [2024-10-12 20:05:37,434 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2024-10-12 20:05:37,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:05:37,449 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:05:37,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:05:37,507 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;@53c522b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:05:37,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:05:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 91 states have (on average 1.8131868131868132) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:37,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 20:05:37,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:37,518 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] [2024-10-12 20:05:37,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash -644629225, now seen corresponding path program 1 times [2024-10-12 20:05:37,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:37,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199093903] [2024-10-12 20:05:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:37,801 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:05:37,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:37,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199093903] [2024-10-12 20:05:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199093903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:37,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:37,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:05:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143855422] [2024-10-12 20:05:37,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:37,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:05:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:37,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:05:37,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:05:37,836 INFO L87 Difference]: Start difference. First operand has 93 states, 91 states have (on average 1.8131868131868132) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:05:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:37,877 INFO L93 Difference]: Finished difference Result 141 states and 245 transitions. [2024-10-12 20:05:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:05:37,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-12 20:05:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:37,889 INFO L225 Difference]: With dead ends: 141 [2024-10-12 20:05:37,889 INFO L226 Difference]: Without dead ends: 91 [2024-10-12 20:05:37,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:05:37,896 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:37,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-12 20:05:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-12 20:05:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.7777777777777777) internal successors, (160), 90 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 160 transitions. [2024-10-12 20:05:37,940 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 160 transitions. Word has length 22 [2024-10-12 20:05:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:37,940 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 160 transitions. [2024-10-12 20:05:37,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:05:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 160 transitions. [2024-10-12 20:05:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 20:05:37,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:37,942 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] [2024-10-12 20:05:37,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:05:37,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:37,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1961394329, now seen corresponding path program 1 times [2024-10-12 20:05:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:37,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277952932] [2024-10-12 20:05:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:38,180 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:05:38,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:38,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277952932] [2024-10-12 20:05:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277952932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:38,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:38,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:05:38,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591804429] [2024-10-12 20:05:38,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:38,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:05:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:38,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:05:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:38,185 INFO L87 Difference]: Start difference. First operand 91 states and 160 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:05:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:38,278 INFO L93 Difference]: Finished difference Result 141 states and 239 transitions. [2024-10-12 20:05:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:05:38,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-12 20:05:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:38,280 INFO L225 Difference]: With dead ends: 141 [2024-10-12 20:05:38,280 INFO L226 Difference]: Without dead ends: 91 [2024-10-12 20:05:38,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:38,282 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:38,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-12 20:05:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-12 20:05:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:05:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2024-10-12 20:05:38,293 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 22 [2024-10-12 20:05:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:38,293 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2024-10-12 20:05:38,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:05:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2024-10-12 20:05:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:05:38,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:38,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:38,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:05:38,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:38,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:38,299 INFO L85 PathProgramCache]: Analyzing trace with hash 551736366, now seen corresponding path program 1 times [2024-10-12 20:05:38,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:38,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058371653] [2024-10-12 20:05:38,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:38,631 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:05:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058371653] [2024-10-12 20:05:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058371653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:38,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:05:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210706754] [2024-10-12 20:05:38,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:05:38,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:05:38,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:05:38,635 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:39,043 INFO L93 Difference]: Finished difference Result 655 states and 1032 transitions. [2024-10-12 20:05:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:05:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-12 20:05:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:39,051 INFO L225 Difference]: With dead ends: 655 [2024-10-12 20:05:39,054 INFO L226 Difference]: Without dead ends: 608 [2024-10-12 20:05:39,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:05:39,058 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1047 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:39,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 2185 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:05:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-12 20:05:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 136. [2024-10-12 20:05:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 135 states have internal predecessors, (193), 0 states have call successors, (0), 0 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:05:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 193 transitions. [2024-10-12 20:05:39,093 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 193 transitions. Word has length 61 [2024-10-12 20:05:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:39,093 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 193 transitions. [2024-10-12 20:05:39,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 193 transitions. [2024-10-12 20:05:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 20:05:39,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:39,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:39,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:05:39,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1177047518, now seen corresponding path program 1 times [2024-10-12 20:05:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305892902] [2024-10-12 20:05:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:39,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:39,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305892902] [2024-10-12 20:05:39,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305892902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:39,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:39,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:39,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941347209] [2024-10-12 20:05:39,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:39,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:39,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:39,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:39,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:39,241 INFO L87 Difference]: Start difference. First operand 136 states and 193 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:39,263 INFO L93 Difference]: Finished difference Result 309 states and 472 transitions. [2024-10-12 20:05:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:39,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-12 20:05:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:39,265 INFO L225 Difference]: With dead ends: 309 [2024-10-12 20:05:39,265 INFO L226 Difference]: Without dead ends: 217 [2024-10-12 20:05:39,266 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:05:39,266 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 50 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:39,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 185 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-12 20:05:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2024-10-12 20:05:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4906542056074767) internal successors, (319), 214 states have internal predecessors, (319), 0 states have call successors, (0), 0 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:05:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2024-10-12 20:05:39,285 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 63 [2024-10-12 20:05:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:39,285 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2024-10-12 20:05:39,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2024-10-12 20:05:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 20:05:39,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:39,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:39,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:05:39,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:39,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:39,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1179192470, now seen corresponding path program 1 times [2024-10-12 20:05:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:39,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092936591] [2024-10-12 20:05:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:39,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:39,708 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:05:39,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:39,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092936591] [2024-10-12 20:05:39,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092936591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:39,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:39,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:05:39,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8689009] [2024-10-12 20:05:39,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:39,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:05:39,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:39,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:05:39,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:05:39,713 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:39,986 INFO L93 Difference]: Finished difference Result 388 states and 595 transitions. [2024-10-12 20:05:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:05:39,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-12 20:05:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:39,989 INFO L225 Difference]: With dead ends: 388 [2024-10-12 20:05:39,991 INFO L226 Difference]: Without dead ends: 217 [2024-10-12 20:05:39,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:05:39,992 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 144 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:39,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 473 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-12 20:05:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2024-10-12 20:05:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4813084112149533) internal successors, (317), 214 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 317 transitions. [2024-10-12 20:05:40,012 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 317 transitions. Word has length 63 [2024-10-12 20:05:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:40,013 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 317 transitions. [2024-10-12 20:05:40,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 317 transitions. [2024-10-12 20:05:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:05:40,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:40,016 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] [2024-10-12 20:05:40,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:05:40,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:40,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2113811586, now seen corresponding path program 1 times [2024-10-12 20:05:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895802989] [2024-10-12 20:05:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:40,219 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:05:40,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:40,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895802989] [2024-10-12 20:05:40,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895802989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:40,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:40,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:05:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828308011] [2024-10-12 20:05:40,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:40,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:05:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:40,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:05:40,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:40,222 INFO L87 Difference]: Start difference. First operand 215 states and 317 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:05:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:40,245 INFO L93 Difference]: Finished difference Result 221 states and 324 transitions. [2024-10-12 20:05:40,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:05:40,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:05:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:40,248 INFO L225 Difference]: With dead ends: 221 [2024-10-12 20:05:40,248 INFO L226 Difference]: Without dead ends: 219 [2024-10-12 20:05:40,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:40,249 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:40,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-12 20:05:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-12 20:05:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.4678899082568808) internal successors, (320), 218 states have internal predecessors, (320), 0 states have call successors, (0), 0 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:05:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 320 transitions. [2024-10-12 20:05:40,257 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 320 transitions. Word has length 64 [2024-10-12 20:05:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:40,257 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 320 transitions. [2024-10-12 20:05:40,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:05:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 320 transitions. [2024-10-12 20:05:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 20:05:40,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:40,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:40,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:05:40,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1651742026, now seen corresponding path program 1 times [2024-10-12 20:05:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:40,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004869110] [2024-10-12 20:05:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:40,332 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:05:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:40,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004869110] [2024-10-12 20:05:40,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004869110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:40,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:40,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:40,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878467395] [2024-10-12 20:05:40,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:40,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:40,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:40,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:40,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:40,335 INFO L87 Difference]: Start difference. First operand 219 states and 320 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:40,357 INFO L93 Difference]: Finished difference Result 405 states and 613 transitions. [2024-10-12 20:05:40,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:40,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-12 20:05:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:40,359 INFO L225 Difference]: With dead ends: 405 [2024-10-12 20:05:40,359 INFO L226 Difference]: Without dead ends: 309 [2024-10-12 20:05:40,360 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:05:40,360 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:40,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 253 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-12 20:05:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-10-12 20:05:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4934640522875817) internal successors, (457), 306 states have internal predecessors, (457), 0 states have call successors, (0), 0 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:05:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 457 transitions. [2024-10-12 20:05:40,372 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 457 transitions. Word has length 65 [2024-10-12 20:05:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:40,372 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 457 transitions. [2024-10-12 20:05:40,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 457 transitions. [2024-10-12 20:05:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 20:05:40,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:40,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:40,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:05:40,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:40,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2062128714, now seen corresponding path program 1 times [2024-10-12 20:05:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:40,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849130833] [2024-10-12 20:05:40,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:40,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:40,437 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:05:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849130833] [2024-10-12 20:05:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849130833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935221864] [2024-10-12 20:05:40,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:40,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:40,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:40,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:40,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:40,439 INFO L87 Difference]: Start difference. First operand 307 states and 457 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:40,461 INFO L93 Difference]: Finished difference Result 805 states and 1237 transitions. [2024-10-12 20:05:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:40,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-12 20:05:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:40,464 INFO L225 Difference]: With dead ends: 805 [2024-10-12 20:05:40,464 INFO L226 Difference]: Without dead ends: 544 [2024-10-12 20:05:40,464 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:05:40,465 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:40,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 259 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-10-12 20:05:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 542. [2024-10-12 20:05:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.5138632162661738) internal successors, (819), 541 states have internal predecessors, (819), 0 states have call successors, (0), 0 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:05:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 819 transitions. [2024-10-12 20:05:40,480 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 819 transitions. Word has length 65 [2024-10-12 20:05:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:40,480 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 819 transitions. [2024-10-12 20:05:40,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 819 transitions. [2024-10-12 20:05:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 20:05:40,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:40,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:40,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:05:40,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:40,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2004199350, now seen corresponding path program 1 times [2024-10-12 20:05:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:40,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935116342] [2024-10-12 20:05:40,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:40,540 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:05:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:40,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935116342] [2024-10-12 20:05:40,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935116342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:40,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:40,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:40,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897751139] [2024-10-12 20:05:40,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:40,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:40,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:40,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:40,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:40,542 INFO L87 Difference]: Start difference. First operand 542 states and 819 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:40,575 INFO L93 Difference]: Finished difference Result 1486 states and 2281 transitions. [2024-10-12 20:05:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:40,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-12 20:05:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:40,580 INFO L225 Difference]: With dead ends: 1486 [2024-10-12 20:05:40,580 INFO L226 Difference]: Without dead ends: 990 [2024-10-12 20:05:40,581 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:05:40,581 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 60 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:40,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 255 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-12 20:05:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2024-10-12 20:05:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 1.5146909827760893) internal successors, (1495), 987 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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:05:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1495 transitions. [2024-10-12 20:05:40,606 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1495 transitions. Word has length 65 [2024-10-12 20:05:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:40,606 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1495 transitions. [2024-10-12 20:05:40,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1495 transitions. [2024-10-12 20:05:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 20:05:40,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:40,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:40,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:05:40,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:40,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1378543286, now seen corresponding path program 1 times [2024-10-12 20:05:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138839797] [2024-10-12 20:05:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:40,665 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:05:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138839797] [2024-10-12 20:05:40,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138839797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:40,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:40,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977564624] [2024-10-12 20:05:40,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:40,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:40,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:40,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:40,668 INFO L87 Difference]: Start difference. First operand 988 states and 1495 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:40,724 INFO L93 Difference]: Finished difference Result 2776 states and 4225 transitions. [2024-10-12 20:05:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:40,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-12 20:05:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:40,732 INFO L225 Difference]: With dead ends: 2776 [2024-10-12 20:05:40,732 INFO L226 Difference]: Without dead ends: 1834 [2024-10-12 20:05:40,734 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:05:40,735 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 58 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:40,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 257 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2024-10-12 20:05:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1832. [2024-10-12 20:05:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1831 states have (on average 1.5024576734025124) internal successors, (2751), 1831 states have internal predecessors, (2751), 0 states have call successors, (0), 0 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:05:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2751 transitions. [2024-10-12 20:05:40,791 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2751 transitions. Word has length 65 [2024-10-12 20:05:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:40,792 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 2751 transitions. [2024-10-12 20:05:40,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2751 transitions. [2024-10-12 20:05:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 20:05:40,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:40,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:40,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:05:40,793 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:40,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:40,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2027690570, now seen corresponding path program 1 times [2024-10-12 20:05:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:40,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572609848] [2024-10-12 20:05:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572609848] [2024-10-12 20:05:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572609848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:40,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513634187] [2024-10-12 20:05:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:40,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:40,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:40,857 INFO L87 Difference]: Start difference. First operand 1832 states and 2751 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:40,933 INFO L93 Difference]: Finished difference Result 5212 states and 7825 transitions. [2024-10-12 20:05:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:40,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-12 20:05:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:40,946 INFO L225 Difference]: With dead ends: 5212 [2024-10-12 20:05:40,946 INFO L226 Difference]: Without dead ends: 3426 [2024-10-12 20:05:40,951 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:05:40,952 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:40,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 259 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2024-10-12 20:05:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3424. [2024-10-12 20:05:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 3423 states have (on average 1.4814490213263218) internal successors, (5071), 3423 states have internal predecessors, (5071), 0 states have call successors, (0), 0 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:05:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 5071 transitions. [2024-10-12 20:05:41,065 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 5071 transitions. Word has length 65 [2024-10-12 20:05:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:41,066 INFO L471 AbstractCegarLoop]: Abstraction has 3424 states and 5071 transitions. [2024-10-12 20:05:41,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 5071 transitions. [2024-10-12 20:05:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 20:05:41,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:41,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:41,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:05:41,067 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:41,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1964255414, now seen corresponding path program 1 times [2024-10-12 20:05:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:41,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208415812] [2024-10-12 20:05:41,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:41,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:41,147 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:05:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208415812] [2024-10-12 20:05:41,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208415812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:41,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:41,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525359455] [2024-10-12 20:05:41,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:41,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:41,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:41,150 INFO L87 Difference]: Start difference. First operand 3424 states and 5071 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:41,276 INFO L93 Difference]: Finished difference Result 9796 states and 14449 transitions. [2024-10-12 20:05:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-12 20:05:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:41,301 INFO L225 Difference]: With dead ends: 9796 [2024-10-12 20:05:41,302 INFO L226 Difference]: Without dead ends: 6418 [2024-10-12 20:05:41,308 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:05:41,309 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 62 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:41,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 261 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6418 states. [2024-10-12 20:05:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6418 to 6416. [2024-10-12 20:05:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6416 states, 6415 states have (on average 1.4539360872954015) internal successors, (9327), 6415 states have internal predecessors, (9327), 0 states have call successors, (0), 0 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:05:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6416 states to 6416 states and 9327 transitions. [2024-10-12 20:05:41,559 INFO L78 Accepts]: Start accepts. Automaton has 6416 states and 9327 transitions. Word has length 65 [2024-10-12 20:05:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:41,560 INFO L471 AbstractCegarLoop]: Abstraction has 6416 states and 9327 transitions. [2024-10-12 20:05:41,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 6416 states and 9327 transitions. [2024-10-12 20:05:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:05:41,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:41,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:41,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:05:41,563 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:41,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash 252495101, now seen corresponding path program 1 times [2024-10-12 20:05:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:41,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583771920] [2024-10-12 20:05:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:41,770 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:05:41,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583771920] [2024-10-12 20:05:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583771920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:41,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:05:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655731518] [2024-10-12 20:05:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:41,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:05:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:05:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:05:41,772 INFO L87 Difference]: Start difference. First operand 6416 states and 9327 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:05:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:42,714 INFO L93 Difference]: Finished difference Result 44062 states and 64150 transitions. [2024-10-12 20:05:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:05:42,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 85 [2024-10-12 20:05:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:42,841 INFO L225 Difference]: With dead ends: 44062 [2024-10-12 20:05:42,842 INFO L226 Difference]: Without dead ends: 39580 [2024-10-12 20:05:42,864 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:05:42,866 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 871 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:42,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1087 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39580 states. [2024-10-12 20:05:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39580 to 11856. [2024-10-12 20:05:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11856 states, 11855 states have (on average 1.4480809784900885) internal successors, (17167), 11855 states have internal predecessors, (17167), 0 states have call successors, (0), 0 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:05:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11856 states to 11856 states and 17167 transitions. [2024-10-12 20:05:43,563 INFO L78 Accepts]: Start accepts. Automaton has 11856 states and 17167 transitions. Word has length 85 [2024-10-12 20:05:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:43,564 INFO L471 AbstractCegarLoop]: Abstraction has 11856 states and 17167 transitions. [2024-10-12 20:05:43,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:05:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 11856 states and 17167 transitions. [2024-10-12 20:05:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:05:43,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:43,568 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:43,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:05:43,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:43,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:43,569 INFO L85 PathProgramCache]: Analyzing trace with hash -157891587, now seen corresponding path program 1 times [2024-10-12 20:05:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:43,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281895866] [2024-10-12 20:05:43,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:43,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:05:43,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:43,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281895866] [2024-10-12 20:05:43,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281895866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:43,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:43,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:05:43,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978550397] [2024-10-12 20:05:43,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:43,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:05:43,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:43,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:05:43,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:05:43,831 INFO L87 Difference]: Start difference. First operand 11856 states and 17167 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:05:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:44,954 INFO L93 Difference]: Finished difference Result 50430 states and 73366 transitions. [2024-10-12 20:05:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:05:44,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 85 [2024-10-12 20:05:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:45,047 INFO L225 Difference]: With dead ends: 50430 [2024-10-12 20:05:45,048 INFO L226 Difference]: Without dead ends: 44060 [2024-10-12 20:05:45,065 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:05:45,066 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 873 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:45,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1058 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44060 states. [2024-10-12 20:05:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44060 to 20464. [2024-10-12 20:05:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20464 states, 20463 states have (on average 1.4441186531789083) internal successors, (29551), 20463 states have internal predecessors, (29551), 0 states have call successors, (0), 0 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:05:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20464 states to 20464 states and 29551 transitions. [2024-10-12 20:05:46,243 INFO L78 Accepts]: Start accepts. Automaton has 20464 states and 29551 transitions. Word has length 85 [2024-10-12 20:05:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:46,244 INFO L471 AbstractCegarLoop]: Abstraction has 20464 states and 29551 transitions. [2024-10-12 20:05:46,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:05:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 20464 states and 29551 transitions. [2024-10-12 20:05:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:05:46,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:46,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:46,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:05:46,249 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:46,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:46,249 INFO L85 PathProgramCache]: Analyzing trace with hash -386530819, now seen corresponding path program 1 times [2024-10-12 20:05:46,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:46,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502167709] [2024-10-12 20:05:46,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:46,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:05:46,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:46,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502167709] [2024-10-12 20:05:46,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502167709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:46,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:46,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:05:46,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164808823] [2024-10-12 20:05:46,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:46,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:05:46,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:46,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:05:46,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:05:46,448 INFO L87 Difference]: Start difference. First operand 20464 states and 29551 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:47,798 INFO L93 Difference]: Finished difference Result 56798 states and 82550 transitions. [2024-10-12 20:05:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:05:47,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-12 20:05:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:47,909 INFO L225 Difference]: With dead ends: 56798 [2024-10-12 20:05:47,909 INFO L226 Difference]: Without dead ends: 50428 [2024-10-12 20:05:47,933 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:05:47,934 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 913 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:47,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1077 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50428 states. [2024-10-12 20:05:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50428 to 26832. [2024-10-12 20:05:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26832 states, 26831 states have (on average 1.4436659088367934) internal successors, (38735), 26831 states have internal predecessors, (38735), 0 states have call successors, (0), 0 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:05:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26832 states to 26832 states and 38735 transitions. [2024-10-12 20:05:49,397 INFO L78 Accepts]: Start accepts. Automaton has 26832 states and 38735 transitions. Word has length 85 [2024-10-12 20:05:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:49,397 INFO L471 AbstractCegarLoop]: Abstraction has 26832 states and 38735 transitions. [2024-10-12 20:05:49,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 26832 states and 38735 transitions. [2024-10-12 20:05:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:05:49,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:49,402 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:49,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:05:49,403 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:49,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1012186883, now seen corresponding path program 1 times [2024-10-12 20:05:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:49,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055569435] [2024-10-12 20:05:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:05:49,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055569435] [2024-10-12 20:05:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055569435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:49,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:49,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:05:49,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542263282] [2024-10-12 20:05:49,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:49,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:05:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:49,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:05:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:05:49,593 INFO L87 Difference]: Start difference. First operand 26832 states and 38735 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:05:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:50,887 INFO L93 Difference]: Finished difference Result 63166 states and 91734 transitions. [2024-10-12 20:05:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:05:50,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 85 [2024-10-12 20:05:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:51,060 INFO L225 Difference]: With dead ends: 63166 [2024-10-12 20:05:51,061 INFO L226 Difference]: Without dead ends: 56796 [2024-10-12 20:05:51,083 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:05:51,084 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 965 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:51,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1061 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56796 states. [2024-10-12 20:05:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56796 to 33200. [2024-10-12 20:05:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33200 states, 33199 states have (on average 1.4433868490014758) internal successors, (47919), 33199 states have internal predecessors, (47919), 0 states have call successors, (0), 0 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:05:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33200 states to 33200 states and 47919 transitions. [2024-10-12 20:05:52,707 INFO L78 Accepts]: Start accepts. Automaton has 33200 states and 47919 transitions. Word has length 85 [2024-10-12 20:05:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:52,708 INFO L471 AbstractCegarLoop]: Abstraction has 33200 states and 47919 transitions. [2024-10-12 20:05:52,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:05:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33200 states and 47919 transitions. [2024-10-12 20:05:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:05:52,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:52,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:52,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:05:52,712 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:52,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash -123453443, now seen corresponding path program 1 times [2024-10-12 20:05:52,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:52,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001960537] [2024-10-12 20:05:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 20:05:52,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:52,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001960537] [2024-10-12 20:05:52,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001960537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:52,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:52,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:05:52,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921356389] [2024-10-12 20:05:52,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:52,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:05:52,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:05:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:05:52,881 INFO L87 Difference]: Start difference. First operand 33200 states and 47919 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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:05:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:54,162 INFO L93 Difference]: Finished difference Result 69534 states and 100918 transitions. [2024-10-12 20:05:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:05:54,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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 85 [2024-10-12 20:05:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:54,279 INFO L225 Difference]: With dead ends: 69534 [2024-10-12 20:05:54,279 INFO L226 Difference]: Without dead ends: 63164 [2024-10-12 20:05:54,302 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:05:54,303 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 881 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:54,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1114 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63164 states. [2024-10-12 20:05:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63164 to 39568. [2024-10-12 20:05:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39568 states, 39567 states have (on average 1.4431976141734273) internal successors, (57103), 39567 states have internal predecessors, (57103), 0 states have call successors, (0), 0 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:05:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39568 states to 39568 states and 57103 transitions. [2024-10-12 20:05:55,584 INFO L78 Accepts]: Start accepts. Automaton has 39568 states and 57103 transitions. Word has length 85 [2024-10-12 20:05:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:55,584 INFO L471 AbstractCegarLoop]: Abstraction has 39568 states and 57103 transitions. [2024-10-12 20:05:55,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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:05:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 39568 states and 57103 transitions. [2024-10-12 20:05:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:05:55,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:55,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:55,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:05:55,589 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:55,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash -426474755, now seen corresponding path program 1 times [2024-10-12 20:05:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:55,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652082876] [2024-10-12 20:05:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:55,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:05:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:55,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652082876] [2024-10-12 20:05:55,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652082876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:55,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:55,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:05:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960552747] [2024-10-12 20:05:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:55,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:05:55,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:05:55,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:05:55,779 INFO L87 Difference]: Start difference. First operand 39568 states and 57103 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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:05:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:57,273 INFO L93 Difference]: Finished difference Result 75902 states and 110102 transitions. [2024-10-12 20:05:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:05:57,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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 85 [2024-10-12 20:05:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:57,349 INFO L225 Difference]: With dead ends: 75902 [2024-10-12 20:05:57,349 INFO L226 Difference]: Without dead ends: 69532 [2024-10-12 20:05:57,368 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:05:57,369 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 822 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:57,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1217 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69532 states. [2024-10-12 20:05:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69532 to 45936. [2024-10-12 20:05:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45936 states, 45935 states have (on average 1.4430608468488082) internal successors, (66287), 45935 states have internal predecessors, (66287), 0 states have call successors, (0), 0 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:05:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45936 states to 45936 states and 66287 transitions. [2024-10-12 20:05:58,972 INFO L78 Accepts]: Start accepts. Automaton has 45936 states and 66287 transitions. Word has length 85 [2024-10-12 20:05:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:58,972 INFO L471 AbstractCegarLoop]: Abstraction has 45936 states and 66287 transitions. [2024-10-12 20:05:58,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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:05:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 45936 states and 66287 transitions. [2024-10-12 20:05:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 20:05:58,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:58,978 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:58,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:05:58,978 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:58,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1951030758, now seen corresponding path program 1 times [2024-10-12 20:05:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:58,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176121077] [2024-10-12 20:05:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:59,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176121077] [2024-10-12 20:05:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176121077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:59,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:59,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621502762] [2024-10-12 20:05:59,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:59,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:59,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:59,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:59,086 INFO L87 Difference]: Start difference. First operand 45936 states and 66287 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:06:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:00,096 INFO L93 Difference]: Finished difference Result 91828 states and 132529 transitions. [2024-10-12 20:06:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:06:00,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-12 20:06:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:00,151 INFO L225 Difference]: With dead ends: 91828 [2024-10-12 20:06:00,151 INFO L226 Difference]: Without dead ends: 45938 [2024-10-12 20:06:00,168 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:06:00,169 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 53 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:00,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 266 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:06:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45938 states. [2024-10-12 20:06:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45938 to 45936. [2024-10-12 20:06:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45936 states, 45935 states have (on average 1.428083160988353) internal successors, (65599), 45935 states have internal predecessors, (65599), 0 states have call successors, (0), 0 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:06:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45936 states to 45936 states and 65599 transitions. [2024-10-12 20:06:01,705 INFO L78 Accepts]: Start accepts. Automaton has 45936 states and 65599 transitions. Word has length 86 [2024-10-12 20:06:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:01,706 INFO L471 AbstractCegarLoop]: Abstraction has 45936 states and 65599 transitions. [2024-10-12 20:06:01,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:06:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 45936 states and 65599 transitions. [2024-10-12 20:06:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:06:01,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:01,710 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:01,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:06:01,710 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:01,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2126529701, now seen corresponding path program 1 times [2024-10-12 20:06:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:01,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924279763] [2024-10-12 20:06:01,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:01,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:01,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:01,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924279763] [2024-10-12 20:06:01,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924279763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:01,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:01,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:06:01,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375824313] [2024-10-12 20:06:01,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:01,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:06:01,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:01,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:06:01,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:06:01,800 INFO L87 Difference]: Start difference. First operand 45936 states and 65599 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:02,336 INFO L93 Difference]: Finished difference Result 62760 states and 89862 transitions. [2024-10-12 20:06:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:06:02,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-12 20:06:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:02,357 INFO L225 Difference]: With dead ends: 62760 [2024-10-12 20:06:02,357 INFO L226 Difference]: Without dead ends: 16870 [2024-10-12 20:06:02,373 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:06:02,374 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 47 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:02,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 263 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:06:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16870 states. [2024-10-12 20:06:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16870 to 16863. [2024-10-12 20:06:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16863 states, 16862 states have (on average 1.4269956114339937) internal successors, (24062), 16862 states have internal predecessors, (24062), 0 states have call successors, (0), 0 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:06:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16863 states to 16863 states and 24062 transitions. [2024-10-12 20:06:02,711 INFO L78 Accepts]: Start accepts. Automaton has 16863 states and 24062 transitions. Word has length 87 [2024-10-12 20:06:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:02,711 INFO L471 AbstractCegarLoop]: Abstraction has 16863 states and 24062 transitions. [2024-10-12 20:06:02,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 16863 states and 24062 transitions. [2024-10-12 20:06:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 20:06:02,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:02,713 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:02,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:06:02,714 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:02,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1925920404, now seen corresponding path program 1 times [2024-10-12 20:06:02,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:02,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963020902] [2024-10-12 20:06:02,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:02,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:02,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963020902] [2024-10-12 20:06:02,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963020902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:02,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:02,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:06:02,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457550000] [2024-10-12 20:06:02,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:02,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:06:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:02,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:06:02,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:06:02,809 INFO L87 Difference]: Start difference. First operand 16863 states and 24062 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:06:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:03,096 INFO L93 Difference]: Finished difference Result 25267 states and 36064 transitions. [2024-10-12 20:06:03,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:06:03,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 20:06:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:03,112 INFO L225 Difference]: With dead ends: 25267 [2024-10-12 20:06:03,112 INFO L226 Difference]: Without dead ends: 8465 [2024-10-12 20:06:03,124 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:06:03,125 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 49 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:03,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 242 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:06:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8465 states. [2024-10-12 20:06:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8465 to 8463. [2024-10-12 20:06:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8463 states, 8462 states have (on average 1.4112502954384307) internal successors, (11942), 8462 states have internal predecessors, (11942), 0 states have call successors, (0), 0 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:06:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 11942 transitions. [2024-10-12 20:06:03,338 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 11942 transitions. Word has length 88 [2024-10-12 20:06:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:03,338 INFO L471 AbstractCegarLoop]: Abstraction has 8463 states and 11942 transitions. [2024-10-12 20:06:03,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:06:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 11942 transitions. [2024-10-12 20:06:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:06:03,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:03,340 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] [2024-10-12 20:06:03,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:06:03,341 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:03,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash -718208830, now seen corresponding path program 1 times [2024-10-12 20:06:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329822794] [2024-10-12 20:06:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:03,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:03,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329822794] [2024-10-12 20:06:03,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329822794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:03,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:03,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:06:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012863863] [2024-10-12 20:06:03,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:03,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:06:03,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:03,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:06:03,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:06:03,428 INFO L87 Difference]: Start difference. First operand 8463 states and 11942 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:06:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:03,536 INFO L93 Difference]: Finished difference Result 12667 states and 17884 transitions. [2024-10-12 20:06:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:06:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:06:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:03,544 INFO L225 Difference]: With dead ends: 12667 [2024-10-12 20:06:03,545 INFO L226 Difference]: Without dead ends: 4265 [2024-10-12 20:06:03,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:06:03,551 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 46 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:03,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 227 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:06:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4265 states. [2024-10-12 20:06:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4265 to 4263. [2024-10-12 20:06:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 4262 states have (on average 1.3941811356170812) internal successors, (5942), 4262 states have internal predecessors, (5942), 0 states have call successors, (0), 0 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:06:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 5942 transitions. [2024-10-12 20:06:03,661 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 5942 transitions. Word has length 90 [2024-10-12 20:06:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:03,662 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 5942 transitions. [2024-10-12 20:06:03,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:06:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 5942 transitions. [2024-10-12 20:06:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:06:03,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:03,663 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:06:03,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:06:03,664 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:03,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1658494064, now seen corresponding path program 1 times [2024-10-12 20:06:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:03,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637950875] [2024-10-12 20:06:03,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:03,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637950875] [2024-10-12 20:06:03,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637950875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:03,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:03,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:06:03,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985974306] [2024-10-12 20:06:03,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:03,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:06:03,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:06:03,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:06:03,799 INFO L87 Difference]: Start difference. First operand 4263 states and 5942 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:03,881 INFO L93 Difference]: Finished difference Result 6367 states and 8884 transitions. [2024-10-12 20:06:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:06:03,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:06:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:03,887 INFO L225 Difference]: With dead ends: 6367 [2024-10-12 20:06:03,887 INFO L226 Difference]: Without dead ends: 2165 [2024-10-12 20:06:03,891 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:06:03,891 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 43 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:03,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 212 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:06:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2024-10-12 20:06:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 2163. [2024-10-12 20:06:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.3746530989824237) internal successors, (2972), 2162 states have internal predecessors, (2972), 0 states have call successors, (0), 0 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:06:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2972 transitions. [2024-10-12 20:06:03,977 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2972 transitions. Word has length 92 [2024-10-12 20:06:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:03,977 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 2972 transitions. [2024-10-12 20:06:03,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2972 transitions. [2024-10-12 20:06:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:06:03,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:03,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:03,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:06:03,979 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:03,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 993978782, now seen corresponding path program 1 times [2024-10-12 20:06:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080811638] [2024-10-12 20:06:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:04,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:04,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080811638] [2024-10-12 20:06:04,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080811638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:04,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:04,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:06:04,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135231070] [2024-10-12 20:06:04,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:04,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:06:04,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:04,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:06:04,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:06:04,105 INFO L87 Difference]: Start difference. First operand 2163 states and 2972 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:04,150 INFO L93 Difference]: Finished difference Result 3217 states and 4429 transitions. [2024-10-12 20:06:04,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:06:04,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-12 20:06:04,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:04,155 INFO L225 Difference]: With dead ends: 3217 [2024-10-12 20:06:04,155 INFO L226 Difference]: Without dead ends: 1115 [2024-10-12 20:06:04,157 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:06:04,157 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 40 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:04,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 197 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:06:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-12 20:06:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1113. [2024-10-12 20:06:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1112 states have (on average 1.3507194244604317) internal successors, (1502), 1112 states have internal predecessors, (1502), 0 states have call successors, (0), 0 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:06:04,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1502 transitions. [2024-10-12 20:06:04,205 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1502 transitions. Word has length 94 [2024-10-12 20:06:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:04,205 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1502 transitions. [2024-10-12 20:06:04,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1502 transitions. [2024-10-12 20:06:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:06:04,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:04,207 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] [2024-10-12 20:06:04,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:06:04,207 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:04,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash 65849420, now seen corresponding path program 1 times [2024-10-12 20:06:04,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:04,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444212335] [2024-10-12 20:06:04,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:04,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:05,170 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:06:05,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:05,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444212335] [2024-10-12 20:06:05,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444212335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:06:05,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114352558] [2024-10-12 20:06:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:05,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:06:05,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:06:05,174 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:06:05,175 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:06:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:05,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 20:06:05,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:06:05,622 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:06:05,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:06:05,858 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:06:05,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114352558] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:06:05,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:06:05,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 4] total 17 [2024-10-12 20:06:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391755886] [2024-10-12 20:06:05,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:06:05,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 20:06:05,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 20:06:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:06:05,862 INFO L87 Difference]: Start difference. First operand 1113 states and 1502 transitions. Second operand has 17 states, 17 states have (on average 16.176470588235293) internal successors, (275), 17 states have internal predecessors, (275), 0 states have call successors, (0), 0 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:06:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:08,452 INFO L93 Difference]: Finished difference Result 9420 states and 12802 transitions. [2024-10-12 20:06:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-12 20:06:08,453 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.176470588235293) internal successors, (275), 17 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-12 20:06:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:08,463 INFO L225 Difference]: With dead ends: 9420 [2024-10-12 20:06:08,463 INFO L226 Difference]: Without dead ends: 8368 [2024-10-12 20:06:08,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=696, Invalid=3210, Unknown=0, NotChecked=0, Total=3906 [2024-10-12 20:06:08,467 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 2931 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2931 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:08,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2931 Valid, 765 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:06:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8368 states. [2024-10-12 20:06:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8368 to 8200. [2024-10-12 20:06:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8200 states, 8199 states have (on average 1.3211367239907306) internal successors, (10832), 8199 states have internal predecessors, (10832), 0 states have call successors, (0), 0 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:06:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 10832 transitions. [2024-10-12 20:06:08,648 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 10832 transitions. Word has length 96 [2024-10-12 20:06:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:08,648 INFO L471 AbstractCegarLoop]: Abstraction has 8200 states and 10832 transitions. [2024-10-12 20:06:08,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.176470588235293) internal successors, (275), 17 states have internal predecessors, (275), 0 states have call successors, (0), 0 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:06:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 10832 transitions. [2024-10-12 20:06:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:06:08,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:08,650 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:08,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 20:06:08,850 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,SelfDestructingSolverStorable24 [2024-10-12 20:06:08,851 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:08,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash -690570241, now seen corresponding path program 1 times [2024-10-12 20:06:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:08,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126168783] [2024-10-12 20:06:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:09,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126168783] [2024-10-12 20:06:09,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126168783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:06:09,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399092316] [2024-10-12 20:06:09,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:09,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:06:09,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:06:09,809 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:06:09,810 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:06:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:09,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-12 20:06:09,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:06:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:12,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:06:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:15,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399092316] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:06:15,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:06:15,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 18] total 43 [2024-10-12 20:06:15,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863650708] [2024-10-12 20:06:15,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:06:15,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-12 20:06:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:15,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-12 20:06:15,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1652, Unknown=0, NotChecked=0, Total=1892 [2024-10-12 20:06:15,160 INFO L87 Difference]: Start difference. First operand 8200 states and 10832 transitions. Second operand has 44 states, 44 states have (on average 5.886363636363637) internal successors, (259), 43 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:06:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:42,701 INFO L93 Difference]: Finished difference Result 130608 states and 174180 transitions. [2024-10-12 20:06:42,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2024-10-12 20:06:42,702 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.886363636363637) internal successors, (259), 43 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:06:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:42,901 INFO L225 Difference]: With dead ends: 130608 [2024-10-12 20:06:42,902 INFO L226 Difference]: Without dead ends: 122549 [2024-10-12 20:06:42,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18933 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=7556, Invalid=42844, Unknown=0, NotChecked=0, Total=50400 [2024-10-12 20:06:42,948 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 7304 mSDsluCounter, 2793 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7304 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 3339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:42,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7304 Valid, 2935 Invalid, 3339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 3163 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:06:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122549 states. [2024-10-12 20:06:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122549 to 63224. [2024-10-12 20:06:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63224 states, 63223 states have (on average 1.2937380383721113) internal successors, (81794), 63223 states have internal predecessors, (81794), 0 states have call successors, (0), 0 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:06:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63224 states to 63224 states and 81794 transitions. [2024-10-12 20:06:44,872 INFO L78 Accepts]: Start accepts. Automaton has 63224 states and 81794 transitions. Word has length 97 [2024-10-12 20:06:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:44,873 INFO L471 AbstractCegarLoop]: Abstraction has 63224 states and 81794 transitions. [2024-10-12 20:06:44,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.886363636363637) internal successors, (259), 43 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:06:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 63224 states and 81794 transitions. [2024-10-12 20:06:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:06:44,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:44,876 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] [2024-10-12 20:06:44,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:06:45,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-12 20:06:45,077 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:45,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash -298103762, now seen corresponding path program 1 times [2024-10-12 20:06:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945787196] [2024-10-12 20:06:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945787196] [2024-10-12 20:06:46,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945787196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:06:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571500678] [2024-10-12 20:06:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:46,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:06:46,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:06:46,031 INFO L229 MonitoredProcess]: Starting monitored process 4 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:06:46,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:06:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:46,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 20:06:46,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:06:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:46,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:06:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:06:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571500678] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:06:48,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:06:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2024-10-12 20:06:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087090746] [2024-10-12 20:06:48,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:06:48,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-12 20:06:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:48,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-12 20:06:48,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 20:06:48,391 INFO L87 Difference]: Start difference. First operand 63224 states and 81794 transitions. Second operand has 33 states, 33 states have (on average 8.303030303030303) internal successors, (274), 32 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)