./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.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.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 a452dfa966a0e4feaa14ada0c4d0013b48db706f82d3f0485b7e78bd9c5210df --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:52:01,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:52:01,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:52:01,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:52:01,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:52:01,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:52:01,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:52:01,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:52:01,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:52:01,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:52:01,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:52:01,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:52:01,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:52:01,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:52:01,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:52:01,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:52:01,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:52:01,848 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:52:01,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:52:01,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:52:01,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:52:01,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:52:01,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:52:01,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:52:01,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:52:01,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:52:01,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:52:01,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:52:01,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:52:01,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:52:01,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:52:01,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:52:01,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:52:01,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:52:01,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:52:01,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:52:01,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:52:01,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:52:01,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:52:01,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:52:01,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:52:01,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:52:01,856 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 -> a452dfa966a0e4feaa14ada0c4d0013b48db706f82d3f0485b7e78bd9c5210df [2024-11-08 15:52:02,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:52:02,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:52:02,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:52:02,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:52:02,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:52:02,148 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:52:03,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:52:03,790 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:52:03,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:52:03,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86461aef4/89729c604fa5443aa5be6090d8621186/FLAGc2397332a [2024-11-08 15:52:03,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86461aef4/89729c604fa5443aa5be6090d8621186 [2024-11-08 15:52:03,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:52:03,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:52:03,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:52:03,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:52:03,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:52:03,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:52:03" (1/1) ... [2024-11-08 15:52:03,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a83b5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:03, skipping insertion in model container [2024-11-08 15:52:03,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:52:03" (1/1) ... [2024-11-08 15:52:03,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:52:04,288 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12984,12997] [2024-11-08 15:52:04,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:52:04,353 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:52:04,405 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12984,12997] [2024-11-08 15:52:04,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:52:04,558 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:52:04,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04 WrapperNode [2024-11-08 15:52:04,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:52:04,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:52:04,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:52:04,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:52:04,569 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:52:04" (1/1) ... [2024-11-08 15:52:04,592 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:52:04" (1/1) ... [2024-11-08 15:52:04,666 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1367 [2024-11-08 15:52:04,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:52:04,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:52:04,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:52:04,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:52:04,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,723 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:52:04,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:52:04,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:52:04,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:52:04,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:52:04,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (1/1) ... [2024-11-08 15:52:04,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:52:04,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:52:04,827 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:52:04,829 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:52:04,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:52:04,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:52:04,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:52:04,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:52:05,024 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:52:05,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:52:05,917 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-11-08 15:52:05,917 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:52:05,940 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:52:05,940 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:52:05,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:52:05 BoogieIcfgContainer [2024-11-08 15:52:05,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:52:05,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:52:05,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:52:05,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:52:05,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:52:03" (1/3) ... [2024-11-08 15:52:05,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e2e41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:52:05, skipping insertion in model container [2024-11-08 15:52:05,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:52:04" (2/3) ... [2024-11-08 15:52:05,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e2e41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:52:05, skipping insertion in model container [2024-11-08 15:52:05,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:52:05" (3/3) ... [2024-11-08 15:52:05,950 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:52:05,963 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:52:05,963 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:52:06,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:52:06,026 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;@570229fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:52:06,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:52:06,032 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:52:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 15:52:06,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:06,044 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:52:06,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:06,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash 430105228, now seen corresponding path program 1 times [2024-11-08 15:52:06,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281677573] [2024-11-08 15:52:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:06,594 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:52:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:06,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281677573] [2024-11-08 15:52:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281677573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020381551] [2024-11-08 15:52:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:06,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:06,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:06,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:06,625 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:52:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:06,753 INFO L93 Difference]: Finished difference Result 589 states and 1021 transitions. [2024-11-08 15:52:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:06,758 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:52:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:06,772 INFO L225 Difference]: With dead ends: 589 [2024-11-08 15:52:06,773 INFO L226 Difference]: Without dead ends: 446 [2024-11-08 15:52:06,776 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:52:06,779 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:52:06,780 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:52:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-08 15:52:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 443. [2024-11-08 15:52:06,842 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:52:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 734 transitions. [2024-11-08 15:52:06,848 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 734 transitions. Word has length 110 [2024-11-08 15:52:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:06,849 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 734 transitions. [2024-11-08 15:52:06,849 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:52:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 734 transitions. [2024-11-08 15:52:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 15:52:06,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:06,854 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:52:06,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:52:06,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:06,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1228540371, now seen corresponding path program 1 times [2024-11-08 15:52:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485632972] [2024-11-08 15:52:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:07,140 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:52:07,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:07,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485632972] [2024-11-08 15:52:07,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485632972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:07,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4759683] [2024-11-08 15:52:07,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:07,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:07,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:07,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:07,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:07,145 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:52:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:07,192 INFO L93 Difference]: Finished difference Result 933 states and 1550 transitions. [2024-11-08 15:52:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:07,193 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:52:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:07,199 INFO L225 Difference]: With dead ends: 933 [2024-11-08 15:52:07,199 INFO L226 Difference]: Without dead ends: 679 [2024-11-08 15:52:07,201 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:52:07,203 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:52:07,203 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:52:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-08 15:52:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 675. [2024-11-08 15:52:07,242 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:52:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1118 transitions. [2024-11-08 15:52:07,244 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1118 transitions. Word has length 113 [2024-11-08 15:52:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:07,244 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1118 transitions. [2024-11-08 15:52:07,245 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:52:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1118 transitions. [2024-11-08 15:52:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 15:52:07,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:07,251 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:52:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:52:07,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:07,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1403707664, now seen corresponding path program 1 times [2024-11-08 15:52:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354266808] [2024-11-08 15:52:07,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:07,474 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:52:07,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354266808] [2024-11-08 15:52:07,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354266808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:07,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:07,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402946076] [2024-11-08 15:52:07,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:07,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:07,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:07,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:07,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:07,481 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:52:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:07,517 INFO L93 Difference]: Finished difference Result 1611 states and 2668 transitions. [2024-11-08 15:52:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:07,518 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:52:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:07,522 INFO L225 Difference]: With dead ends: 1611 [2024-11-08 15:52:07,522 INFO L226 Difference]: Without dead ends: 1125 [2024-11-08 15:52:07,523 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:52:07,524 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:52:07,526 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:52:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-08 15:52:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1119. [2024-11-08 15:52:07,545 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:52:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1846 transitions. [2024-11-08 15:52:07,549 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1846 transitions. Word has length 116 [2024-11-08 15:52:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:07,549 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1846 transitions. [2024-11-08 15:52:07,550 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:52:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1846 transitions. [2024-11-08 15:52:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 15:52:07,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:07,553 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:52:07,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:52:07,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:07,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:07,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1658128561, now seen corresponding path program 1 times [2024-11-08 15:52:07,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:07,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126906954] [2024-11-08 15:52:07,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:07,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:07,701 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:52:07,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:07,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126906954] [2024-11-08 15:52:07,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126906954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:07,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:07,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203651454] [2024-11-08 15:52:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:07,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:07,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:07,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:07,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:07,704 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:52:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:07,740 INFO L93 Difference]: Finished difference Result 2907 states and 4784 transitions. [2024-11-08 15:52:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:07,740 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:52:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:07,746 INFO L225 Difference]: With dead ends: 2907 [2024-11-08 15:52:07,746 INFO L226 Difference]: Without dead ends: 1977 [2024-11-08 15:52:07,748 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:52:07,749 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:52:07,749 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:52:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-11-08 15:52:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1967. [2024-11-08 15:52:07,778 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:52:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3222 transitions. [2024-11-08 15:52:07,785 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3222 transitions. Word has length 119 [2024-11-08 15:52:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:07,786 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3222 transitions. [2024-11-08 15:52:07,786 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:52:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3222 transitions. [2024-11-08 15:52:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 15:52:07,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:07,788 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:52:07,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:52:07,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:07,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1735235476, now seen corresponding path program 1 times [2024-11-08 15:52:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946345505] [2024-11-08 15:52:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:08,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:08,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946345505] [2024-11-08 15:52:08,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946345505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:08,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:08,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175287259] [2024-11-08 15:52:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:08,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:08,005 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:52:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:08,292 INFO L93 Difference]: Finished difference Result 10223 states and 16898 transitions. [2024-11-08 15:52:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:52:08,293 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:52:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:08,365 INFO L225 Difference]: With dead ends: 10223 [2024-11-08 15:52:08,366 INFO L226 Difference]: Without dead ends: 8445 [2024-11-08 15:52:08,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:52:08,371 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:08,373 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.2s Time] [2024-11-08 15:52:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2024-11-08 15:52:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 3625. [2024-11-08 15:52:08,439 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:52:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5937 transitions. [2024-11-08 15:52:08,448 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5937 transitions. Word has length 122 [2024-11-08 15:52:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:08,448 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5937 transitions. [2024-11-08 15:52:08,448 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:52:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5937 transitions. [2024-11-08 15:52:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 15:52:08,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:08,451 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:52:08,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:52:08,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:08,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2109337106, now seen corresponding path program 1 times [2024-11-08 15:52:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:08,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226347126] [2024-11-08 15:52:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:08,585 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:52:08,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:08,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226347126] [2024-11-08 15:52:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226347126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:52:08,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745415088] [2024-11-08 15:52:08,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:08,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:52:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:08,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:52:08,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:08,587 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:52:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:08,677 INFO L93 Difference]: Finished difference Result 10605 states and 17475 transitions. [2024-11-08 15:52:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:52:08,677 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:52:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:08,698 INFO L225 Difference]: With dead ends: 10605 [2024-11-08 15:52:08,699 INFO L226 Difference]: Without dead ends: 7169 [2024-11-08 15:52:08,703 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:52:08,704 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:52:08,705 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:52:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2024-11-08 15:52:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 5380. [2024-11-08 15:52:08,791 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:52:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 8831 transitions. [2024-11-08 15:52:08,807 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 8831 transitions. Word has length 123 [2024-11-08 15:52:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:08,808 INFO L471 AbstractCegarLoop]: Abstraction has 5380 states and 8831 transitions. [2024-11-08 15:52:08,808 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:52:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 8831 transitions. [2024-11-08 15:52:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 15:52:08,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:08,811 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:52:08,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:52:08,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:08,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1027444837, now seen corresponding path program 1 times [2024-11-08 15:52:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:08,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715691103] [2024-11-08 15:52:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:08,966 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:52:08,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715691103] [2024-11-08 15:52:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715691103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:08,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:08,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:52:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663817697] [2024-11-08 15:52:08,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:08,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:52:08,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:08,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:52:08,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:08,969 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:52:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:09,061 INFO L93 Difference]: Finished difference Result 15777 states and 25981 transitions. [2024-11-08 15:52:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:52:09,062 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:52:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:09,091 INFO L225 Difference]: With dead ends: 15777 [2024-11-08 15:52:09,091 INFO L226 Difference]: Without dead ends: 10586 [2024-11-08 15:52:09,098 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:52:09,099 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:52:09,099 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:52:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10586 states. [2024-11-08 15:52:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10586 to 7959. [2024-11-08 15:52:09,225 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:52:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 13056 transitions. [2024-11-08 15:52:09,248 INFO L78 Accepts]: Start accepts. Automaton has 7959 states and 13056 transitions. Word has length 124 [2024-11-08 15:52:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:09,248 INFO L471 AbstractCegarLoop]: Abstraction has 7959 states and 13056 transitions. [2024-11-08 15:52:09,249 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:52:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7959 states and 13056 transitions. [2024-11-08 15:52:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:52:09,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:09,252 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:52:09,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:52:09,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -275676370, now seen corresponding path program 1 times [2024-11-08 15:52:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790191568] [2024-11-08 15:52:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:09,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:09,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790191568] [2024-11-08 15:52:09,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790191568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:09,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:09,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:09,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38994964] [2024-11-08 15:52:09,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:09,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:09,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:09,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:09,414 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:52:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:09,505 INFO L93 Difference]: Finished difference Result 15656 states and 25739 transitions. [2024-11-08 15:52:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:09,506 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:52:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:09,524 INFO L225 Difference]: With dead ends: 15656 [2024-11-08 15:52:09,525 INFO L226 Difference]: Without dead ends: 11380 [2024-11-08 15:52:09,534 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:52:09,536 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:52:09,536 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:52:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2024-11-08 15:52:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 11378. [2024-11-08 15:52:09,717 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:52:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11378 states to 11378 states and 18629 transitions. [2024-11-08 15:52:09,744 INFO L78 Accepts]: Start accepts. Automaton has 11378 states and 18629 transitions. Word has length 125 [2024-11-08 15:52:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:09,744 INFO L471 AbstractCegarLoop]: Abstraction has 11378 states and 18629 transitions. [2024-11-08 15:52:09,745 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:52:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 11378 states and 18629 transitions. [2024-11-08 15:52:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:52:09,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:09,748 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:52:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:52:09,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:09,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash 15369622, now seen corresponding path program 1 times [2024-11-08 15:52:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775162820] [2024-11-08 15:52:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:09,846 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:52:09,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:09,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775162820] [2024-11-08 15:52:09,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775162820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:09,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:09,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:09,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425960959] [2024-11-08 15:52:09,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:09,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:09,848 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:52:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:09,910 INFO L93 Difference]: Finished difference Result 22088 states and 36263 transitions. [2024-11-08 15:52:09,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:09,911 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:52:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:09,935 INFO L225 Difference]: With dead ends: 22088 [2024-11-08 15:52:09,935 INFO L226 Difference]: Without dead ends: 16096 [2024-11-08 15:52:09,947 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:52:09,948 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:52:09,948 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:52:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2024-11-08 15:52:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 16094. [2024-11-08 15:52:10,181 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:52:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16094 states to 16094 states and 26297 transitions. [2024-11-08 15:52:10,204 INFO L78 Accepts]: Start accepts. Automaton has 16094 states and 26297 transitions. Word has length 125 [2024-11-08 15:52:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:10,205 INFO L471 AbstractCegarLoop]: Abstraction has 16094 states and 26297 transitions. [2024-11-08 15:52:10,205 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:52:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 16094 states and 26297 transitions. [2024-11-08 15:52:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:52:10,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:10,207 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:52:10,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:52:10,207 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:10,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1843964843, now seen corresponding path program 1 times [2024-11-08 15:52:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:10,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167479212] [2024-11-08 15:52:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:10,327 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:52:10,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:10,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167479212] [2024-11-08 15:52:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167479212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:10,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:52:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222473701] [2024-11-08 15:52:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:10,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:52:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:52:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:10,329 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:52:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:10,467 INFO L93 Difference]: Finished difference Result 50960 states and 83572 transitions. [2024-11-08 15:52:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:52:10,468 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:52:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:10,520 INFO L225 Difference]: With dead ends: 50960 [2024-11-08 15:52:10,520 INFO L226 Difference]: Without dead ends: 35474 [2024-11-08 15:52:10,548 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:52:10,548 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:52:10,549 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:52:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2024-11-08 15:52:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 25732. [2024-11-08 15:52:11,058 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:52:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25732 states to 25732 states and 42007 transitions. [2024-11-08 15:52:11,096 INFO L78 Accepts]: Start accepts. Automaton has 25732 states and 42007 transitions. Word has length 125 [2024-11-08 15:52:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:11,096 INFO L471 AbstractCegarLoop]: Abstraction has 25732 states and 42007 transitions. [2024-11-08 15:52:11,096 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:52:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 25732 states and 42007 transitions. [2024-11-08 15:52:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:52:11,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:11,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:52:11,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:11,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash -815921210, now seen corresponding path program 1 times [2024-11-08 15:52:11,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:11,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605257664] [2024-11-08 15:52:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:11,551 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:52:11,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:11,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605257664] [2024-11-08 15:52:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605257664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:11,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:11,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484988084] [2024-11-08 15:52:11,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:11,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:11,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:11,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:11,554 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:52:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:11,797 INFO L93 Difference]: Finished difference Result 55910 states and 91585 transitions. [2024-11-08 15:52:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:11,798 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:52:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:11,871 INFO L225 Difference]: With dead ends: 55910 [2024-11-08 15:52:11,871 INFO L226 Difference]: Without dead ends: 38187 [2024-11-08 15:52:11,893 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:52:11,894 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:52:11,894 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:52:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38187 states. [2024-11-08 15:52:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38187 to 38185. [2024-11-08 15:52:12,317 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:52:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38185 states to 38185 states and 62250 transitions. [2024-11-08 15:52:12,612 INFO L78 Accepts]: Start accepts. Automaton has 38185 states and 62250 transitions. Word has length 125 [2024-11-08 15:52:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:12,613 INFO L471 AbstractCegarLoop]: Abstraction has 38185 states and 62250 transitions. [2024-11-08 15:52:12,613 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:52:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 38185 states and 62250 transitions. [2024-11-08 15:52:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:52:12,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:12,614 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:52:12,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:52:12,615 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:12,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2056786782, now seen corresponding path program 1 times [2024-11-08 15:52:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:12,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507455062] [2024-11-08 15:52:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:12,721 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:52:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507455062] [2024-11-08 15:52:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507455062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:12,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:12,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375559174] [2024-11-08 15:52:12,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:12,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:12,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:12,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:12,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:12,724 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:52:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:13,075 INFO L93 Difference]: Finished difference Result 83692 states and 137539 transitions. [2024-11-08 15:52:13,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:13,079 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:52:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:13,184 INFO L225 Difference]: With dead ends: 83692 [2024-11-08 15:52:13,185 INFO L226 Difference]: Without dead ends: 56811 [2024-11-08 15:52:13,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:13,217 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:52:13,217 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:52:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56811 states. [2024-11-08 15:52:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56811 to 56809. [2024-11-08 15:52:14,137 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:52:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56809 states to 56809 states and 92718 transitions. [2024-11-08 15:52:14,253 INFO L78 Accepts]: Start accepts. Automaton has 56809 states and 92718 transitions. Word has length 125 [2024-11-08 15:52:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:14,253 INFO L471 AbstractCegarLoop]: Abstraction has 56809 states and 92718 transitions. [2024-11-08 15:52:14,253 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:52:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 56809 states and 92718 transitions. [2024-11-08 15:52:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 15:52:14,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:14,255 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:52:14,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:52:14,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:14,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1381723230, now seen corresponding path program 1 times [2024-11-08 15:52:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:14,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219434321] [2024-11-08 15:52:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:14,410 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:52:14,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:14,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219434321] [2024-11-08 15:52:14,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219434321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:14,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:14,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:52:14,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346802354] [2024-11-08 15:52:14,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:14,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:52:14,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:14,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:52:14,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:14,413 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:52:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:15,188 INFO L93 Difference]: Finished difference Result 182062 states and 297983 transitions. [2024-11-08 15:52:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:52:15,188 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:52:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:15,384 INFO L225 Difference]: With dead ends: 182062 [2024-11-08 15:52:15,384 INFO L226 Difference]: Without dead ends: 125497 [2024-11-08 15:52:15,444 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:52:15,445 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:52:15,446 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:52:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125497 states. [2024-11-08 15:52:16,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125497 to 90928. [2024-11-08 15:52:16,616 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:52:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 148071 transitions. [2024-11-08 15:52:16,758 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 148071 transitions. Word has length 126 [2024-11-08 15:52:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:16,759 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 148071 transitions. [2024-11-08 15:52:16,759 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:52:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 148071 transitions. [2024-11-08 15:52:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 15:52:16,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:16,760 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:52:16,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:52:16,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:16,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2086532755, now seen corresponding path program 1 times [2024-11-08 15:52:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:16,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219649410] [2024-11-08 15:52:16,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:17,630 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:52:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:17,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219649410] [2024-11-08 15:52:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219649410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:17,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:17,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046662089] [2024-11-08 15:52:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:17,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:17,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:17,633 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:52:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:18,292 INFO L93 Difference]: Finished difference Result 181614 states and 295752 transitions. [2024-11-08 15:52:18,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:52:18,293 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:52:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:18,412 INFO L225 Difference]: With dead ends: 181614 [2024-11-08 15:52:18,412 INFO L226 Difference]: Without dead ends: 90930 [2024-11-08 15:52:18,488 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:52:18,489 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 381 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:52:18,489 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:52:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90930 states. [2024-11-08 15:52:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90930 to 90928. [2024-11-08 15:52:20,149 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:52:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 147446 transitions. [2024-11-08 15:52:20,325 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 147446 transitions. Word has length 128 [2024-11-08 15:52:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:20,326 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 147446 transitions. [2024-11-08 15:52:20,326 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:52:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 147446 transitions. [2024-11-08 15:52:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 15:52:20,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:20,327 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:52:20,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:52:20,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1082243879, now seen corresponding path program 1 times [2024-11-08 15:52:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559402824] [2024-11-08 15:52:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:20,616 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:52:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559402824] [2024-11-08 15:52:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559402824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:20,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641056412] [2024-11-08 15:52:20,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:20,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:20,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:20,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:20,619 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:52:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:21,707 INFO L93 Difference]: Finished difference Result 265772 states and 431468 transitions. [2024-11-08 15:52:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:52:21,707 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:52:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:21,933 INFO L225 Difference]: With dead ends: 265772 [2024-11-08 15:52:21,933 INFO L226 Difference]: Without dead ends: 175088 [2024-11-08 15:52:21,981 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:52:21,981 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:52:21,981 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:52:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175088 states. [2024-11-08 15:52:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175088 to 175086. [2024-11-08 15:52:24,275 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:52:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175086 states to 175086 states and 282395 transitions. [2024-11-08 15:52:24,575 INFO L78 Accepts]: Start accepts. Automaton has 175086 states and 282395 transitions. Word has length 131 [2024-11-08 15:52:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:24,576 INFO L471 AbstractCegarLoop]: Abstraction has 175086 states and 282395 transitions. [2024-11-08 15:52:24,576 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:52:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 175086 states and 282395 transitions. [2024-11-08 15:52:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 15:52:24,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:24,577 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:52:24,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:52:24,577 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:24,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash -812087216, now seen corresponding path program 1 times [2024-11-08 15:52:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575765365] [2024-11-08 15:52:24,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:24,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:25,557 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:52:25,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:25,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575765365] [2024-11-08 15:52:25,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575765365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:25,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:25,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:52:25,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611240207] [2024-11-08 15:52:25,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:25,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:52:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:52:25,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:52:25,561 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:52:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:26,003 INFO L93 Difference]: Finished difference Result 178960 states and 288204 transitions. [2024-11-08 15:52:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:52:26,003 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:52:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:26,276 INFO L225 Difference]: With dead ends: 178960 [2024-11-08 15:52:26,276 INFO L226 Difference]: Without dead ends: 178958 [2024-11-08 15:52:26,335 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:52:26,337 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:52:26,337 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:52:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178958 states. [2024-11-08 15:52:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178958 to 178958. [2024-11-08 15:52:28,744 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:52:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178958 states to 178958 states and 286240 transitions. [2024-11-08 15:52:29,108 INFO L78 Accepts]: Start accepts. Automaton has 178958 states and 286240 transitions. Word has length 132 [2024-11-08 15:52:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:29,108 INFO L471 AbstractCegarLoop]: Abstraction has 178958 states and 286240 transitions. [2024-11-08 15:52:29,108 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:52:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 178958 states and 286240 transitions. [2024-11-08 15:52:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:52:29,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:29,114 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:29,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:52:29,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:29,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1146801810, now seen corresponding path program 1 times [2024-11-08 15:52:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996254075] [2024-11-08 15:52:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:29,402 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:52:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:29,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996254075] [2024-11-08 15:52:29,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996254075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:29,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:29,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765463954] [2024-11-08 15:52:29,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:29,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:29,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:29,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:29,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:29,405 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:52:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:31,600 INFO L93 Difference]: Finished difference Result 487720 states and 782945 transitions. [2024-11-08 15:52:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:52:31,601 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:52:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:33,099 INFO L225 Difference]: With dead ends: 487720 [2024-11-08 15:52:33,100 INFO L226 Difference]: Without dead ends: 409068 [2024-11-08 15:52:33,177 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:52:33,180 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:52:33,181 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:52:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409068 states. [2024-11-08 15:52:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409068 to 287506. [2024-11-08 15:52:37,477 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:52:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287506 states to 287506 states and 459488 transitions. [2024-11-08 15:52:38,105 INFO L78 Accepts]: Start accepts. Automaton has 287506 states and 459488 transitions. Word has length 163 [2024-11-08 15:52:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:38,108 INFO L471 AbstractCegarLoop]: Abstraction has 287506 states and 459488 transitions. [2024-11-08 15:52:38,108 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:52:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 287506 states and 459488 transitions. [2024-11-08 15:52:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:52:38,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:38,113 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:38,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:52:38,113 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:38,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1437847802, now seen corresponding path program 1 times [2024-11-08 15:52:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:38,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583794992] [2024-11-08 15:52:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:38,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:39,007 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:52:39,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:39,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583794992] [2024-11-08 15:52:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583794992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:39,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:39,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:39,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740794445] [2024-11-08 15:52:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:39,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:39,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:39,009 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:52:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:41,393 INFO L93 Difference]: Finished difference Result 518940 states and 833205 transitions. [2024-11-08 15:52:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:52:41,395 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:52:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:42,321 INFO L225 Difference]: With dead ends: 518940 [2024-11-08 15:52:42,322 INFO L226 Difference]: Without dead ends: 440288 [2024-11-08 15:52:42,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:52:42,429 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1394 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:42,431 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.2s Time] [2024-11-08 15:52:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440288 states. [2024-11-08 15:52:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440288 to 388624. [2024-11-08 15:52:48,218 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:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388624 states to 388624 states and 621624 transitions. [2024-11-08 15:52:49,184 INFO L78 Accepts]: Start accepts. Automaton has 388624 states and 621624 transitions. Word has length 163 [2024-11-08 15:52:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:49,184 INFO L471 AbstractCegarLoop]: Abstraction has 388624 states and 621624 transitions. [2024-11-08 15:52:49,185 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:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 388624 states and 621624 transitions. [2024-11-08 15:52:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:52:49,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:49,189 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:49,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:52:49,189 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:49,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash 606556970, now seen corresponding path program 1 times [2024-11-08 15:52:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728148252] [2024-11-08 15:52:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:49,365 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:49,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:49,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728148252] [2024-11-08 15:52:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728148252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:49,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:49,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980889966] [2024-11-08 15:52:49,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:49,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:49,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:49,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:49,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:49,367 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)