./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16db63adfa8747ce86c67ae78be78e889eae71e4b07fbcb21a84ad0decbbdac7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:51:22,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:51:22,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:51:22,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:51:22,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:51:22,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:51:22,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:51:22,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:51:22,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:51:22,310 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:51:22,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:51:22,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:51:22,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:51:22,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:51:22,311 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:51:22,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:51:22,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:51:22,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:51:22,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:51:22,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:51:22,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:51:22,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:51:22,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:51:22,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:51:22,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:51:22,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:51:22,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:51:22,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:51:22,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:51:22,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:51:22,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:51:22,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:51:22,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:51:22,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:51:22,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:51:22,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:51:22,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:51:22,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:51:22,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:51:22,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:51:22,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:51:22,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:51:22,323 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 -> 16db63adfa8747ce86c67ae78be78e889eae71e4b07fbcb21a84ad0decbbdac7 [2024-11-08 15:51:22,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:51:22,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:51:22,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:51:22,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:51:22,533 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:51:22,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:51:23,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:51:23,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:51:23,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:51:23,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf4db65a/2d5d892c62e74c6eaa78bb40928b119d/FLAG047663c8b [2024-11-08 15:51:23,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf4db65a/2d5d892c62e74c6eaa78bb40928b119d [2024-11-08 15:51:23,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:51:23,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:51:23,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:51:23,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:51:23,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:51:23,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:51:23" (1/1) ... [2024-11-08 15:51:23,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51291c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:23, skipping insertion in model container [2024-11-08 15:51:23,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:51:23" (1/1) ... [2024-11-08 15:51:24,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:51:24,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2024-11-08 15:51:24,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:51:24,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:51:24,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2024-11-08 15:51:24,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:51:24,457 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:51:24,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24 WrapperNode [2024-11-08 15:51:24,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:51:24,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:51:24,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:51:24,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:51:24,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,518 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1367 [2024-11-08 15:51:24,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:51:24,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:51:24,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:51:24,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:51:24,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,561 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:51:24,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:51:24,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:51:24,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:51:24,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:51:24,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (1/1) ... [2024-11-08 15:51:24,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:51:24,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:51:24,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:51:24,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:51:24,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:51:24,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:51:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:51:24,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:51:24,831 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:51:24,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:51:25,806 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-11-08 15:51:25,806 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:51:25,829 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:51:25,829 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:51:25,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:51:25 BoogieIcfgContainer [2024-11-08 15:51:25,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:51:25,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:51:25,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:51:25,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:51:25,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:51:23" (1/3) ... [2024-11-08 15:51:25,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2221e8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:51:25, skipping insertion in model container [2024-11-08 15:51:25,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:24" (2/3) ... [2024-11-08 15:51:25,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2221e8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:51:25, skipping insertion in model container [2024-11-08 15:51:25,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:51:25" (3/3) ... [2024-11-08 15:51:25,838 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:51:25,854 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:51:25,854 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:51:25,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:51:25,928 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;@55c57998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:51:25,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:51:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 324 states have (on average 1.7962962962962963) internal successors, (582), 325 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 15:51:25,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:25,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:25,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:25,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash 430105228, now seen corresponding path program 1 times [2024-11-08 15:51:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:25,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012278284] [2024-11-08 15:51:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:26,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:26,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012278284] [2024-11-08 15:51:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012278284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:26,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666645531] [2024-11-08 15:51:26,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:26,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:26,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:26,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:26,510 INFO L87 Difference]: Start difference. First operand has 326 states, 324 states have (on average 1.7962962962962963) internal successors, (582), 325 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:26,628 INFO L93 Difference]: Finished difference Result 589 states and 1021 transitions. [2024-11-08 15:51:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:26,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-08 15:51:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:26,645 INFO L225 Difference]: With dead ends: 589 [2024-11-08 15:51:26,645 INFO L226 Difference]: Without dead ends: 446 [2024-11-08 15:51:26,648 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-11-08 15:51:26,650 INFO L432 NwaCegarLoop]: 576 mSDtfsCounter, 232 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:26,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1074 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:26,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-08 15:51:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 443. [2024-11-08 15:51:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.660633484162896) internal successors, (734), 442 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 734 transitions. [2024-11-08 15:51:26,703 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 734 transitions. Word has length 110 [2024-11-08 15:51:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:26,704 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 734 transitions. [2024-11-08 15:51:26,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 734 transitions. [2024-11-08 15:51:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 15:51:26,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:26,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:26,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:51:26,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:26,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1228540371, now seen corresponding path program 1 times [2024-11-08 15:51:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:26,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487923736] [2024-11-08 15:51:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:26,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487923736] [2024-11-08 15:51:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487923736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:26,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504336642] [2024-11-08 15:51:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:26,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:26,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:26,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:26,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:26,935 INFO L87 Difference]: Start difference. First operand 443 states and 734 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:26,971 INFO L93 Difference]: Finished difference Result 933 states and 1550 transitions. [2024-11-08 15:51:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:26,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-08 15:51:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:26,976 INFO L225 Difference]: With dead ends: 933 [2024-11-08 15:51:26,978 INFO L226 Difference]: Without dead ends: 679 [2024-11-08 15:51:26,979 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-11-08 15:51:26,980 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 200 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:26,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1028 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-08 15:51:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 675. [2024-11-08 15:51:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.6587537091988132) internal successors, (1118), 674 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1118 transitions. [2024-11-08 15:51:27,006 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1118 transitions. Word has length 113 [2024-11-08 15:51:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:27,007 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1118 transitions. [2024-11-08 15:51:27,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1118 transitions. [2024-11-08 15:51:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 15:51:27,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:27,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:27,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:51:27,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:27,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1403707664, now seen corresponding path program 1 times [2024-11-08 15:51:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:27,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095536422] [2024-11-08 15:51:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:27,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:27,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095536422] [2024-11-08 15:51:27,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095536422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:27,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:27,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:27,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356897289] [2024-11-08 15:51:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:27,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:27,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:27,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:27,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:27,227 INFO L87 Difference]: Start difference. First operand 675 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:27,262 INFO L93 Difference]: Finished difference Result 1611 states and 2668 transitions. [2024-11-08 15:51:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-08 15:51:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:27,268 INFO L225 Difference]: With dead ends: 1611 [2024-11-08 15:51:27,268 INFO L226 Difference]: Without dead ends: 1125 [2024-11-08 15:51:27,269 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-11-08 15:51:27,270 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 194 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:27,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1029 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-08 15:51:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1119. [2024-11-08 15:51:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1118 states have (on average 1.6511627906976745) internal successors, (1846), 1118 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1846 transitions. [2024-11-08 15:51:27,295 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1846 transitions. Word has length 116 [2024-11-08 15:51:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:27,296 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1846 transitions. [2024-11-08 15:51:27,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1846 transitions. [2024-11-08 15:51:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 15:51:27,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:27,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:27,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:51:27,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:27,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1658128561, now seen corresponding path program 1 times [2024-11-08 15:51:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:27,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235971540] [2024-11-08 15:51:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:27,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:27,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:27,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235971540] [2024-11-08 15:51:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235971540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:27,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:27,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:27,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063759073] [2024-11-08 15:51:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:27,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:27,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:27,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:27,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:27,449 INFO L87 Difference]: Start difference. First operand 1119 states and 1846 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:27,485 INFO L93 Difference]: Finished difference Result 2907 states and 4784 transitions. [2024-11-08 15:51:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:27,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-08 15:51:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:27,491 INFO L225 Difference]: With dead ends: 2907 [2024-11-08 15:51:27,491 INFO L226 Difference]: Without dead ends: 1977 [2024-11-08 15:51:27,495 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-11-08 15:51:27,496 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 188 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:27,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1030 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-11-08 15:51:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1967. [2024-11-08 15:51:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1966 states have (on average 1.6388606307222788) internal successors, (3222), 1966 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3222 transitions. [2024-11-08 15:51:27,550 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3222 transitions. Word has length 119 [2024-11-08 15:51:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:27,550 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3222 transitions. [2024-11-08 15:51:27,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3222 transitions. [2024-11-08 15:51:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 15:51:27,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:27,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:27,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:51:27,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:27,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1735235476, now seen corresponding path program 1 times [2024-11-08 15:51:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606327749] [2024-11-08 15:51:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:27,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606327749] [2024-11-08 15:51:27,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606327749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:27,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:27,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:27,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623740117] [2024-11-08 15:51:27,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:27,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:27,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:27,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:27,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:27,764 INFO L87 Difference]: Start difference. First operand 1967 states and 3222 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:28,025 INFO L93 Difference]: Finished difference Result 10223 states and 16898 transitions. [2024-11-08 15:51:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:51:28,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-08 15:51:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:28,048 INFO L225 Difference]: With dead ends: 10223 [2024-11-08 15:51:28,048 INFO L226 Difference]: Without dead ends: 8445 [2024-11-08 15:51:28,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:51:28,054 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 2115 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 3920 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:28,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 3920 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2024-11-08 15:51:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 3625. [2024-11-08 15:51:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 3624 states have (on average 1.6382450331125828) internal successors, (5937), 3624 states have internal predecessors, (5937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5937 transitions. [2024-11-08 15:51:28,153 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5937 transitions. Word has length 122 [2024-11-08 15:51:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:28,154 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5937 transitions. [2024-11-08 15:51:28,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5937 transitions. [2024-11-08 15:51:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 15:51:28,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:28,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:28,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:51:28,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:28,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2109337106, now seen corresponding path program 1 times [2024-11-08 15:51:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:28,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713316423] [2024-11-08 15:51:28,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:28,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713316423] [2024-11-08 15:51:28,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713316423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:28,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:28,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:28,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174476745] [2024-11-08 15:51:28,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:28,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:28,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:28,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:28,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:28,314 INFO L87 Difference]: Start difference. First operand 3625 states and 5937 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:28,408 INFO L93 Difference]: Finished difference Result 10605 states and 17475 transitions. [2024-11-08 15:51:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:28,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-08 15:51:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:28,429 INFO L225 Difference]: With dead ends: 10605 [2024-11-08 15:51:28,430 INFO L226 Difference]: Without dead ends: 7169 [2024-11-08 15:51:28,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:28,437 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 658 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:28,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1605 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2024-11-08 15:51:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 5380. [2024-11-08 15:51:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5380 states, 5379 states have (on average 1.6417549730433165) internal successors, (8831), 5379 states have internal predecessors, (8831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 8831 transitions. [2024-11-08 15:51:28,553 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 8831 transitions. Word has length 123 [2024-11-08 15:51:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:28,553 INFO L471 AbstractCegarLoop]: Abstraction has 5380 states and 8831 transitions. [2024-11-08 15:51:28,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 8831 transitions. [2024-11-08 15:51:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 15:51:28,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:28,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:28,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:51:28,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:28,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:28,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1027444837, now seen corresponding path program 1 times [2024-11-08 15:51:28,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:28,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420632639] [2024-11-08 15:51:28,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:28,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420632639] [2024-11-08 15:51:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420632639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:28,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:28,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358032311] [2024-11-08 15:51:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:28,675 INFO L87 Difference]: Start difference. First operand 5380 states and 8831 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:28,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:28,786 INFO L93 Difference]: Finished difference Result 15777 states and 25981 transitions. [2024-11-08 15:51:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:28,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-08 15:51:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:28,813 INFO L225 Difference]: With dead ends: 15777 [2024-11-08 15:51:28,813 INFO L226 Difference]: Without dead ends: 10586 [2024-11-08 15:51:28,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:28,823 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 656 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:28,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1653 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10586 states. [2024-11-08 15:51:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10586 to 7959. [2024-11-08 15:51:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7959 states, 7958 states have (on average 1.6406132194018597) internal successors, (13056), 7958 states have internal predecessors, (13056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 13056 transitions. [2024-11-08 15:51:28,989 INFO L78 Accepts]: Start accepts. Automaton has 7959 states and 13056 transitions. Word has length 124 [2024-11-08 15:51:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:28,990 INFO L471 AbstractCegarLoop]: Abstraction has 7959 states and 13056 transitions. [2024-11-08 15:51:28,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 7959 states and 13056 transitions. [2024-11-08 15:51:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:28,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:28,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:28,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:51:28,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:28,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash -275676370, now seen corresponding path program 1 times [2024-11-08 15:51:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:28,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194623216] [2024-11-08 15:51:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:29,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194623216] [2024-11-08 15:51:29,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194623216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:29,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:29,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185446585] [2024-11-08 15:51:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:29,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:29,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:29,083 INFO L87 Difference]: Start difference. First operand 7959 states and 13056 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:29,175 INFO L93 Difference]: Finished difference Result 15656 states and 25739 transitions. [2024-11-08 15:51:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:29,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:29,195 INFO L225 Difference]: With dead ends: 15656 [2024-11-08 15:51:29,195 INFO L226 Difference]: Without dead ends: 11380 [2024-11-08 15:51:29,205 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-11-08 15:51:29,206 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 193 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:29,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2024-11-08 15:51:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 11378. [2024-11-08 15:51:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11378 states, 11377 states have (on average 1.6374263865693943) internal successors, (18629), 11377 states have internal predecessors, (18629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11378 states to 11378 states and 18629 transitions. [2024-11-08 15:51:29,412 INFO L78 Accepts]: Start accepts. Automaton has 11378 states and 18629 transitions. Word has length 125 [2024-11-08 15:51:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:29,413 INFO L471 AbstractCegarLoop]: Abstraction has 11378 states and 18629 transitions. [2024-11-08 15:51:29,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11378 states and 18629 transitions. [2024-11-08 15:51:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:29,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:29,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:29,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:51:29,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:29,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash 15369622, now seen corresponding path program 1 times [2024-11-08 15:51:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:29,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599485347] [2024-11-08 15:51:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:29,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:29,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599485347] [2024-11-08 15:51:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599485347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:29,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:29,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317854942] [2024-11-08 15:51:29,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:29,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:29,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:29,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:29,504 INFO L87 Difference]: Start difference. First operand 11378 states and 18629 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:29,608 INFO L93 Difference]: Finished difference Result 22088 states and 36263 transitions. [2024-11-08 15:51:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:29,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:29,642 INFO L225 Difference]: With dead ends: 22088 [2024-11-08 15:51:29,642 INFO L226 Difference]: Without dead ends: 16096 [2024-11-08 15:51:29,655 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-11-08 15:51:29,656 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 187 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:29,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1094 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2024-11-08 15:51:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 16094. [2024-11-08 15:51:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16094 states, 16093 states have (on average 1.6340645000932081) internal successors, (26297), 16093 states have internal predecessors, (26297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16094 states to 16094 states and 26297 transitions. [2024-11-08 15:51:29,987 INFO L78 Accepts]: Start accepts. Automaton has 16094 states and 26297 transitions. Word has length 125 [2024-11-08 15:51:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:29,988 INFO L471 AbstractCegarLoop]: Abstraction has 16094 states and 26297 transitions. [2024-11-08 15:51:29,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16094 states and 26297 transitions. [2024-11-08 15:51:29,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:29,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:29,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:29,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:51:29,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:29,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:29,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1843964843, now seen corresponding path program 1 times [2024-11-08 15:51:29,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:29,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020935410] [2024-11-08 15:51:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020935410] [2024-11-08 15:51:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020935410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483042005] [2024-11-08 15:51:30,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:30,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:30,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:30,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:30,165 INFO L87 Difference]: Start difference. First operand 16094 states and 26297 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:30,400 INFO L93 Difference]: Finished difference Result 50960 states and 83572 transitions. [2024-11-08 15:51:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:30,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:30,557 INFO L225 Difference]: With dead ends: 50960 [2024-11-08 15:51:30,558 INFO L226 Difference]: Without dead ends: 35474 [2024-11-08 15:51:30,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:30,589 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 654 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:30,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1550 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2024-11-08 15:51:30,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 25732. [2024-11-08 15:51:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25732 states, 25731 states have (on average 1.6325444016944541) internal successors, (42007), 25731 states have internal predecessors, (42007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25732 states to 25732 states and 42007 transitions. [2024-11-08 15:51:31,067 INFO L78 Accepts]: Start accepts. Automaton has 25732 states and 42007 transitions. Word has length 125 [2024-11-08 15:51:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:31,067 INFO L471 AbstractCegarLoop]: Abstraction has 25732 states and 42007 transitions. [2024-11-08 15:51:31,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 25732 states and 42007 transitions. [2024-11-08 15:51:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:31,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:31,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:31,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:51:31,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:31,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash -815921210, now seen corresponding path program 1 times [2024-11-08 15:51:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223799222] [2024-11-08 15:51:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:31,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223799222] [2024-11-08 15:51:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223799222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:31,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:31,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:31,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530439057] [2024-11-08 15:51:31,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:31,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:31,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:31,148 INFO L87 Difference]: Start difference. First operand 25732 states and 42007 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:31,338 INFO L93 Difference]: Finished difference Result 55910 states and 91585 transitions. [2024-11-08 15:51:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:31,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:31,521 INFO L225 Difference]: With dead ends: 55910 [2024-11-08 15:51:31,521 INFO L226 Difference]: Without dead ends: 38187 [2024-11-08 15:51:31,535 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-11-08 15:51:31,535 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 199 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:31,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38187 states. [2024-11-08 15:51:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38187 to 38185. [2024-11-08 15:51:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38185 states, 38184 states have (on average 1.6302639849151477) internal successors, (62250), 38184 states have internal predecessors, (62250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38185 states to 38185 states and 62250 transitions. [2024-11-08 15:51:32,058 INFO L78 Accepts]: Start accepts. Automaton has 38185 states and 62250 transitions. Word has length 125 [2024-11-08 15:51:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:32,059 INFO L471 AbstractCegarLoop]: Abstraction has 38185 states and 62250 transitions. [2024-11-08 15:51:32,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 38185 states and 62250 transitions. [2024-11-08 15:51:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:51:32,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:32,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:32,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:51:32,061 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:32,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2056786782, now seen corresponding path program 1 times [2024-11-08 15:51:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:32,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926333907] [2024-11-08 15:51:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926333907] [2024-11-08 15:51:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926333907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:51:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708062233] [2024-11-08 15:51:32,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:32,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:51:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:32,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:51:32,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:51:32,171 INFO L87 Difference]: Start difference. First operand 38185 states and 62250 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:32,554 INFO L93 Difference]: Finished difference Result 83692 states and 137539 transitions. [2024-11-08 15:51:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:51:32,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 15:51:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:32,820 INFO L225 Difference]: With dead ends: 83692 [2024-11-08 15:51:32,820 INFO L226 Difference]: Without dead ends: 56811 [2024-11-08 15:51:32,858 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-11-08 15:51:32,859 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 205 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:32,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1203 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56811 states. [2024-11-08 15:51:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56811 to 56809. [2024-11-08 15:51:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56809 states, 56808 states have (on average 1.63212927756654) internal successors, (92718), 56808 states have internal predecessors, (92718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56809 states to 56809 states and 92718 transitions. [2024-11-08 15:51:33,654 INFO L78 Accepts]: Start accepts. Automaton has 56809 states and 92718 transitions. Word has length 125 [2024-11-08 15:51:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:33,654 INFO L471 AbstractCegarLoop]: Abstraction has 56809 states and 92718 transitions. [2024-11-08 15:51:33,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 56809 states and 92718 transitions. [2024-11-08 15:51:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 15:51:33,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:33,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:33,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:51:33,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:33,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1381723230, now seen corresponding path program 1 times [2024-11-08 15:51:33,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:33,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317494397] [2024-11-08 15:51:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:33,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317494397] [2024-11-08 15:51:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317494397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:33,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:33,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:51:33,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771886825] [2024-11-08 15:51:33,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:33,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:51:33,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:33,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:51:33,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:51:33,910 INFO L87 Difference]: Start difference. First operand 56809 states and 92718 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:34,548 INFO L93 Difference]: Finished difference Result 182062 states and 297983 transitions. [2024-11-08 15:51:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:51:34,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-08 15:51:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:34,937 INFO L225 Difference]: With dead ends: 182062 [2024-11-08 15:51:34,938 INFO L226 Difference]: Without dead ends: 125497 [2024-11-08 15:51:34,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:34,983 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 652 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:34,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1766 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125497 states. [2024-11-08 15:51:36,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125497 to 90928. [2024-11-08 15:51:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90928 states, 90927 states have (on average 1.6284601933419116) internal successors, (148071), 90927 states have internal predecessors, (148071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 148071 transitions. [2024-11-08 15:51:36,331 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 148071 transitions. Word has length 126 [2024-11-08 15:51:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:36,332 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 148071 transitions. [2024-11-08 15:51:36,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 148071 transitions. [2024-11-08 15:51:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 15:51:36,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:36,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:36,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:51:36,334 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:36,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:36,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2086532755, now seen corresponding path program 1 times [2024-11-08 15:51:36,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:36,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023895685] [2024-11-08 15:51:36,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:36,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023895685] [2024-11-08 15:51:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023895685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:36,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:36,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105394456] [2024-11-08 15:51:36,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:36,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:36,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:36,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:36,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:36,903 INFO L87 Difference]: Start difference. First operand 90928 states and 148071 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:37,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:37,390 INFO L93 Difference]: Finished difference Result 181614 states and 295752 transitions. [2024-11-08 15:51:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:51:37,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-08 15:51:37,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:37,511 INFO L225 Difference]: With dead ends: 181614 [2024-11-08 15:51:37,511 INFO L226 Difference]: Without dead ends: 90930 [2024-11-08 15:51:37,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:51:37,815 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 381 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:37,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 2040 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90930 states. [2024-11-08 15:51:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90930 to 90928. [2024-11-08 15:51:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90928 states, 90927 states have (on average 1.6215865474501523) internal successors, (147446), 90927 states have internal predecessors, (147446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 147446 transitions. [2024-11-08 15:51:38,938 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 147446 transitions. Word has length 128 [2024-11-08 15:51:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:38,938 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 147446 transitions. [2024-11-08 15:51:38,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 147446 transitions. [2024-11-08 15:51:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 15:51:38,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:38,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:38,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:51:38,940 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:38,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:38,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1082243879, now seen corresponding path program 1 times [2024-11-08 15:51:38,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:38,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481869681] [2024-11-08 15:51:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:38,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:39,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:39,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481869681] [2024-11-08 15:51:39,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481869681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:39,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201990690] [2024-11-08 15:51:39,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:39,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:39,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:39,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:39,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:39,264 INFO L87 Difference]: Start difference. First operand 90928 states and 147446 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:40,211 INFO L93 Difference]: Finished difference Result 265772 states and 431468 transitions. [2024-11-08 15:51:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:51:40,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-11-08 15:51:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:40,438 INFO L225 Difference]: With dead ends: 265772 [2024-11-08 15:51:40,438 INFO L226 Difference]: Without dead ends: 175088 [2024-11-08 15:51:40,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:51:40,538 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 190 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:40,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2562 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175088 states. [2024-11-08 15:51:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175088 to 175086. [2024-11-08 15:51:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175086 states, 175085 states have (on average 1.6129023045949111) internal successors, (282395), 175085 states have internal predecessors, (282395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175086 states to 175086 states and 282395 transitions. [2024-11-08 15:51:43,220 INFO L78 Accepts]: Start accepts. Automaton has 175086 states and 282395 transitions. Word has length 131 [2024-11-08 15:51:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:43,221 INFO L471 AbstractCegarLoop]: Abstraction has 175086 states and 282395 transitions. [2024-11-08 15:51:43,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 175086 states and 282395 transitions. [2024-11-08 15:51:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 15:51:43,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:43,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:43,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:51:43,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:43,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash -812087216, now seen corresponding path program 1 times [2024-11-08 15:51:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:43,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863475509] [2024-11-08 15:51:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:51:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863475509] [2024-11-08 15:51:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863475509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:43,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:43,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:51:43,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494228894] [2024-11-08 15:51:43,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:43,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:51:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:51:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:43,738 INFO L87 Difference]: Start difference. First operand 175086 states and 282395 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:44,743 INFO L93 Difference]: Finished difference Result 178960 states and 288204 transitions. [2024-11-08 15:51:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:51:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-11-08 15:51:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:44,979 INFO L225 Difference]: With dead ends: 178960 [2024-11-08 15:51:44,979 INFO L226 Difference]: Without dead ends: 178958 [2024-11-08 15:51:45,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:51:45,015 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:45,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2115 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:51:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178958 states. [2024-11-08 15:51:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178958 to 178958. [2024-11-08 15:51:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178958 states, 178957 states have (on average 1.5994903803707037) internal successors, (286240), 178957 states have internal predecessors, (286240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178958 states to 178958 states and 286240 transitions. [2024-11-08 15:51:47,431 INFO L78 Accepts]: Start accepts. Automaton has 178958 states and 286240 transitions. Word has length 132 [2024-11-08 15:51:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:47,432 INFO L471 AbstractCegarLoop]: Abstraction has 178958 states and 286240 transitions. [2024-11-08 15:51:47,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 178958 states and 286240 transitions. [2024-11-08 15:51:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:51:47,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:47,436 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:47,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:51:47,437 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:47,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1146801810, now seen corresponding path program 1 times [2024-11-08 15:51:47,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:47,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897854089] [2024-11-08 15:51:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 15:51:47,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:47,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897854089] [2024-11-08 15:51:47,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897854089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:47,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:47,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:47,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628381498] [2024-11-08 15:51:47,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:47,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:47,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:47,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:47,682 INFO L87 Difference]: Start difference. First operand 178958 states and 286240 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:49,713 INFO L93 Difference]: Finished difference Result 487720 states and 782945 transitions. [2024-11-08 15:51:49,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:51:49,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-08 15:51:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:50,541 INFO L225 Difference]: With dead ends: 487720 [2024-11-08 15:51:50,541 INFO L226 Difference]: Without dead ends: 409068 [2024-11-08 15:51:50,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:51:50,704 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 1423 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:50,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 2705 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:51:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409068 states. [2024-11-08 15:51:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409068 to 287506. [2024-11-08 15:51:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287506 states, 287505 states have (on average 1.5981913358028557) internal successors, (459488), 287505 states have internal predecessors, (459488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287506 states to 287506 states and 459488 transitions. [2024-11-08 15:51:55,994 INFO L78 Accepts]: Start accepts. Automaton has 287506 states and 459488 transitions. Word has length 163 [2024-11-08 15:51:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:51:55,995 INFO L471 AbstractCegarLoop]: Abstraction has 287506 states and 459488 transitions. [2024-11-08 15:51:55,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 287506 states and 459488 transitions. [2024-11-08 15:51:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:51:56,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:51:56,001 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:51:56,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:51:56,001 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:51:56,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:51:56,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1437847802, now seen corresponding path program 1 times [2024-11-08 15:51:56,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:51:56,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342372698] [2024-11-08 15:51:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:51:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:51:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:51:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 15:51:56,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:51:56,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342372698] [2024-11-08 15:51:56,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342372698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:51:56,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:51:56,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:51:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193295447] [2024-11-08 15:51:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:51:56,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:51:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:51:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:51:56,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:51:56,244 INFO L87 Difference]: Start difference. First operand 287506 states and 459488 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:51:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:51:58,206 INFO L93 Difference]: Finished difference Result 518940 states and 833205 transitions. [2024-11-08 15:51:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:51:58,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-08 15:51:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:51:59,691 INFO L225 Difference]: With dead ends: 518940 [2024-11-08 15:51:59,691 INFO L226 Difference]: Without dead ends: 440288 [2024-11-08 15:51:59,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:51:59,747 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1394 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:51:59,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 3051 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:52:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440288 states. [2024-11-08 15:52:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440288 to 388624. [2024-11-08 15:52:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388624 states, 388623 states have (on average 1.599555353131441) internal successors, (621624), 388623 states have internal predecessors, (621624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388624 states to 388624 states and 621624 transitions. [2024-11-08 15:52:05,609 INFO L78 Accepts]: Start accepts. Automaton has 388624 states and 621624 transitions. Word has length 163 [2024-11-08 15:52:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:05,610 INFO L471 AbstractCegarLoop]: Abstraction has 388624 states and 621624 transitions. [2024-11-08 15:52:05,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 388624 states and 621624 transitions. [2024-11-08 15:52:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:52:05,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:05,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:52:05,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:52:05,615 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:05,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash 606556970, now seen corresponding path program 1 times [2024-11-08 15:52:05,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:05,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627256738] [2024-11-08 15:52:05,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:52:05,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627256738] [2024-11-08 15:52:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627256738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:05,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025660169] [2024-11-08 15:52:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:05,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:05,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:05,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:05,794 INFO L87 Difference]: Start difference. First operand 388624 states and 621624 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)