./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 742f5d2e7cf114f57c75e9ec70cbf1110245ef125564c2c81d93a290329b3301 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:53:56,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:53:56,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:53:56,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:53:56,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:53:56,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:53:56,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:53:56,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:53:56,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:53:56,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:53:56,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:53:56,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:53:56,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:53:56,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:53:56,234 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:53:56,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:53:56,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:53:56,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:53:56,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:53:56,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:53:56,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:53:56,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:53:56,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:53:56,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:53:56,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:53:56,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:53:56,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:53:56,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:53:56,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:53:56,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:53:56,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:53:56,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:53:56,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:53:56,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:53:56,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:53:56,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:53:56,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:53:56,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:53:56,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:53:56,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:53:56,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:53:56,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:53:56,245 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-clean/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-clean/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 -> 742f5d2e7cf114f57c75e9ec70cbf1110245ef125564c2c81d93a290329b3301 [2024-10-11 03:53:56,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:53:56,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:53:56,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:53:56,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:53:56,546 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:53:56,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-11 03:53:58,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:53:58,314 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:53:58,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-11 03:53:58,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7037ef27a/635f8076e39e40bc90f5dd7c401e9c64/FLAGa0f715561 [2024-10-11 03:53:58,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7037ef27a/635f8076e39e40bc90f5dd7c401e9c64 [2024-10-11 03:53:58,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:53:58,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:53:58,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:53:58,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:53:58,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:53:58,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:53:58" (1/1) ... [2024-10-11 03:53:58,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc0e0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:58, skipping insertion in model container [2024-10-11 03:53:58,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:53:58" (1/1) ... [2024-10-11 03:53:58,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:53:58,859 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15866,15879] [2024-10-11 03:53:58,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:53:58,945 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:53:59,062 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15866,15879] [2024-10-11 03:53:59,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:53:59,134 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:53:59,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59 WrapperNode [2024-10-11 03:53:59,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:53:59,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:53:59,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:53:59,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:53:59,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,214 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1376 [2024-10-11 03:53:59,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:53:59,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:53:59,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:53:59,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:53:59,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,284 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:53:59,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:53:59,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:53:59,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:53:59,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:53:59,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (1/1) ... [2024-10-11 03:53:59,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:53:59,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:53:59,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:53:59,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:53:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:53:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:53:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:53:59,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:53:59,576 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:53:59,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:54:00,788 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-11 03:54:00,789 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:54:00,845 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:54:00,845 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:54:00,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:54:00 BoogieIcfgContainer [2024-10-11 03:54:00,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:54:00,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:54:00,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:54:00,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:54:00,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:53:58" (1/3) ... [2024-10-11 03:54:00,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288f5336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:54:00, skipping insertion in model container [2024-10-11 03:54:00,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:53:59" (2/3) ... [2024-10-11 03:54:00,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288f5336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:54:00, skipping insertion in model container [2024-10-11 03:54:00,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:54:00" (3/3) ... [2024-10-11 03:54:00,859 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-11 03:54:00,875 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:54:00,876 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:54:00,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:54:00,964 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;@5e427469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:54:00,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:54:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 340 states have (on average 1.7735294117647058) internal successors, (603), 341 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 03:54:00,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:00,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:00,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:00,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2070507114, now seen corresponding path program 1 times [2024-10-11 03:54:01,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:01,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415549032] [2024-10-11 03:54:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415549032] [2024-10-11 03:54:01,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415549032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:01,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:01,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:01,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030659187] [2024-10-11 03:54:01,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:01,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:01,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:01,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:01,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:01,736 INFO L87 Difference]: Start difference. First operand has 342 states, 340 states have (on average 1.7735294117647058) internal successors, (603), 341 states have internal predecessors, (603), 0 states have call successors, (0), 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 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:01,936 INFO L93 Difference]: Finished difference Result 698 states and 1216 transitions. [2024-10-11 03:54:01,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:01,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2024-10-11 03:54:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:01,963 INFO L225 Difference]: With dead ends: 698 [2024-10-11 03:54:01,963 INFO L226 Difference]: Without dead ends: 564 [2024-10-11 03:54:01,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:01,969 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 417 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:01,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 999 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-10-11 03:54:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 562. [2024-10-11 03:54:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.499108734402852) internal successors, (841), 561 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 841 transitions. [2024-10-11 03:54:02,054 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 841 transitions. Word has length 154 [2024-10-11 03:54:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:02,057 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 841 transitions. [2024-10-11 03:54:02,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 841 transitions. [2024-10-11 03:54:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 03:54:02,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:02,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:02,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:54:02,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:02,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1178225863, now seen corresponding path program 1 times [2024-10-11 03:54:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57174070] [2024-10-11 03:54:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57174070] [2024-10-11 03:54:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57174070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172229403] [2024-10-11 03:54:02,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:02,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:02,851 INFO L87 Difference]: Start difference. First operand 562 states and 841 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:02,979 INFO L93 Difference]: Finished difference Result 2149 states and 3195 transitions. [2024-10-11 03:54:02,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:54:02,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2024-10-11 03:54:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:02,988 INFO L225 Difference]: With dead ends: 2149 [2024-10-11 03:54:02,988 INFO L226 Difference]: Without dead ends: 1611 [2024-10-11 03:54:02,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:02,992 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 1044 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:02,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1682 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-10-11 03:54:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1086. [2024-10-11 03:54:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.4820276497695852) internal successors, (1608), 1085 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1608 transitions. [2024-10-11 03:54:03,049 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1608 transitions. Word has length 154 [2024-10-11 03:54:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:03,050 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1608 transitions. [2024-10-11 03:54:03,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1608 transitions. [2024-10-11 03:54:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 03:54:03,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:03,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:03,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:54:03,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:03,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 836221869, now seen corresponding path program 1 times [2024-10-11 03:54:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:03,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014259048] [2024-10-11 03:54:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:03,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014259048] [2024-10-11 03:54:03,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014259048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:03,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:03,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028016982] [2024-10-11 03:54:03,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:03,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:03,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:03,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:03,204 INFO L87 Difference]: Start difference. First operand 1086 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:03,234 INFO L93 Difference]: Finished difference Result 2147 states and 3173 transitions. [2024-10-11 03:54:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:03,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-11 03:54:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:03,240 INFO L225 Difference]: With dead ends: 2147 [2024-10-11 03:54:03,240 INFO L226 Difference]: Without dead ends: 1088 [2024-10-11 03:54:03,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:03,245 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:03,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 999 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-11 03:54:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2024-10-11 03:54:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4811407543698252) internal successors, (1610), 1087 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1610 transitions. [2024-10-11 03:54:03,279 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1610 transitions. Word has length 155 [2024-10-11 03:54:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:03,279 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1610 transitions. [2024-10-11 03:54:03,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1610 transitions. [2024-10-11 03:54:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:54:03,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:03,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:03,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:54:03,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:03,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1170517208, now seen corresponding path program 1 times [2024-10-11 03:54:03,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:03,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138233103] [2024-10-11 03:54:03,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:03,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:03,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:03,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138233103] [2024-10-11 03:54:03,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138233103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:03,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:03,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:03,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797270451] [2024-10-11 03:54:03,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:03,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:03,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:03,989 INFO L87 Difference]: Start difference. First operand 1088 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:04,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:04,022 INFO L93 Difference]: Finished difference Result 2163 states and 3199 transitions. [2024-10-11 03:54:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:54:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-11 03:54:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:04,027 INFO L225 Difference]: With dead ends: 2163 [2024-10-11 03:54:04,027 INFO L226 Difference]: Without dead ends: 1088 [2024-10-11 03:54:04,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:04,033 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 20 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:04,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1570 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-11 03:54:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1087. [2024-10-11 03:54:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.4788213627992635) internal successors, (1606), 1086 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1606 transitions. [2024-10-11 03:54:04,091 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1606 transitions. Word has length 156 [2024-10-11 03:54:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:04,091 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1606 transitions. [2024-10-11 03:54:04,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1606 transitions. [2024-10-11 03:54:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:54:04,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:04,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:04,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:54:04,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:04,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1440108541, now seen corresponding path program 1 times [2024-10-11 03:54:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:04,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009625294] [2024-10-11 03:54:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:04,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:04,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:04,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009625294] [2024-10-11 03:54:04,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009625294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:04,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:04,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306588178] [2024-10-11 03:54:04,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:04,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:04,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:04,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:04,660 INFO L87 Difference]: Start difference. First operand 1087 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:04,694 INFO L93 Difference]: Finished difference Result 2166 states and 3200 transitions. [2024-10-11 03:54:04,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:54:04,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-11 03:54:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:04,699 INFO L225 Difference]: With dead ends: 2166 [2024-10-11 03:54:04,699 INFO L226 Difference]: Without dead ends: 1085 [2024-10-11 03:54:04,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:04,701 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 23 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:04,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1572 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-10-11 03:54:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2024-10-11 03:54:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1084 states have (on average 1.477859778597786) internal successors, (1602), 1084 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2024-10-11 03:54:04,726 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 156 [2024-10-11 03:54:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:04,726 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2024-10-11 03:54:04,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2024-10-11 03:54:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:54:04,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:04,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:04,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:54:04,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:04,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash 667678976, now seen corresponding path program 1 times [2024-10-11 03:54:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:04,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365771354] [2024-10-11 03:54:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:04,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:04,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365771354] [2024-10-11 03:54:04,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365771354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:04,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:04,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268289958] [2024-10-11 03:54:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:04,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:04,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:04,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:04,841 INFO L87 Difference]: Start difference. First operand 1085 states and 1602 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:04,899 INFO L93 Difference]: Finished difference Result 2506 states and 3710 transitions. [2024-10-11 03:54:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:04,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-11 03:54:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:04,906 INFO L225 Difference]: With dead ends: 2506 [2024-10-11 03:54:04,906 INFO L226 Difference]: Without dead ends: 1610 [2024-10-11 03:54:04,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:04,908 INFO L432 NwaCegarLoop]: 941 mSDtfsCounter, 426 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:04,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1388 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2024-10-11 03:54:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1608. [2024-10-11 03:54:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.4586185438705663) internal successors, (2344), 1607 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2344 transitions. [2024-10-11 03:54:04,951 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2344 transitions. Word has length 156 [2024-10-11 03:54:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:04,951 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2344 transitions. [2024-10-11 03:54:04,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2344 transitions. [2024-10-11 03:54:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 03:54:04,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:04,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:04,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:54:04,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash 173126011, now seen corresponding path program 1 times [2024-10-11 03:54:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:04,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527742736] [2024-10-11 03:54:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:05,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527742736] [2024-10-11 03:54:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527742736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:05,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:05,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014582181] [2024-10-11 03:54:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:05,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:05,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:05,078 INFO L87 Difference]: Start difference. First operand 1608 states and 2344 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:05,147 INFO L93 Difference]: Finished difference Result 3805 states and 5666 transitions. [2024-10-11 03:54:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:05,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-11 03:54:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:05,156 INFO L225 Difference]: With dead ends: 3805 [2024-10-11 03:54:05,157 INFO L226 Difference]: Without dead ends: 2378 [2024-10-11 03:54:05,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:05,160 INFO L432 NwaCegarLoop]: 701 mSDtfsCounter, 315 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:05,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1069 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2024-10-11 03:54:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2050. [2024-10-11 03:54:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2049 states have (on average 1.495851634943875) internal successors, (3065), 2049 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3065 transitions. [2024-10-11 03:54:05,217 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3065 transitions. Word has length 158 [2024-10-11 03:54:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:05,217 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 3065 transitions. [2024-10-11 03:54:05,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3065 transitions. [2024-10-11 03:54:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:54:05,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:05,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:05,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:54:05,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:05,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -373275925, now seen corresponding path program 1 times [2024-10-11 03:54:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:05,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014342956] [2024-10-11 03:54:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:05,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:05,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014342956] [2024-10-11 03:54:05,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014342956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:05,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:05,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:05,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080287857] [2024-10-11 03:54:05,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:05,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:05,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:05,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:05,320 INFO L87 Difference]: Start difference. First operand 2050 states and 3065 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:05,385 INFO L93 Difference]: Finished difference Result 4929 states and 7511 transitions. [2024-10-11 03:54:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:05,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-10-11 03:54:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:05,399 INFO L225 Difference]: With dead ends: 4929 [2024-10-11 03:54:05,400 INFO L226 Difference]: Without dead ends: 3144 [2024-10-11 03:54:05,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:05,405 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 310 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:05,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1029 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2024-10-11 03:54:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2828. [2024-10-11 03:54:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2827 states have (on average 1.5298903431199151) internal successors, (4325), 2827 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4325 transitions. [2024-10-11 03:54:05,490 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4325 transitions. Word has length 160 [2024-10-11 03:54:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:05,490 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 4325 transitions. [2024-10-11 03:54:05,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4325 transitions. [2024-10-11 03:54:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 03:54:05,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:05,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:05,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:54:05,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:05,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash -81754159, now seen corresponding path program 1 times [2024-10-11 03:54:05,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:05,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743670961] [2024-10-11 03:54:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:05,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:05,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743670961] [2024-10-11 03:54:05,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743670961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:05,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:05,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:05,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292083970] [2024-10-11 03:54:05,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:05,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:05,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:05,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:05,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:05,728 INFO L87 Difference]: Start difference. First operand 2828 states and 4325 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:05,925 INFO L93 Difference]: Finished difference Result 5481 states and 8430 transitions. [2024-10-11 03:54:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:05,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-11 03:54:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:05,936 INFO L225 Difference]: With dead ends: 5481 [2024-10-11 03:54:05,936 INFO L226 Difference]: Without dead ends: 2828 [2024-10-11 03:54:05,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:54:05,940 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 1314 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:05,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 472 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2024-10-11 03:54:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2828. [2024-10-11 03:54:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2827 states have (on average 1.517509727626459) internal successors, (4290), 2827 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4290 transitions. [2024-10-11 03:54:06,008 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4290 transitions. Word has length 161 [2024-10-11 03:54:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 4290 transitions. [2024-10-11 03:54:06,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4290 transitions. [2024-10-11 03:54:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 03:54:06,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:06,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:06,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:54:06,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:06,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash 448774060, now seen corresponding path program 1 times [2024-10-11 03:54:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556574675] [2024-10-11 03:54:06,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:06,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:06,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556574675] [2024-10-11 03:54:06,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556574675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:06,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:06,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031222974] [2024-10-11 03:54:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:06,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:06,522 INFO L87 Difference]: Start difference. First operand 2828 states and 4290 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:06,639 INFO L93 Difference]: Finished difference Result 7156 states and 11129 transitions. [2024-10-11 03:54:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:54:06,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-11 03:54:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:06,659 INFO L225 Difference]: With dead ends: 7156 [2024-10-11 03:54:06,659 INFO L226 Difference]: Without dead ends: 5280 [2024-10-11 03:54:06,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:06,665 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 628 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:06,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 957 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2024-10-11 03:54:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 5278. [2024-10-11 03:54:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5278 states, 5277 states have (on average 1.5279514875876445) internal successors, (8063), 5277 states have internal predecessors, (8063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 8063 transitions. [2024-10-11 03:54:06,799 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 8063 transitions. Word has length 161 [2024-10-11 03:54:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:06,800 INFO L471 AbstractCegarLoop]: Abstraction has 5278 states and 8063 transitions. [2024-10-11 03:54:06,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 8063 transitions. [2024-10-11 03:54:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 03:54:06,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:06,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:06,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:54:06,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:06,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash 870161820, now seen corresponding path program 1 times [2024-10-11 03:54:06,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:06,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865727435] [2024-10-11 03:54:06,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:06,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:07,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:07,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865727435] [2024-10-11 03:54:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865727435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:07,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:07,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:54:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640167624] [2024-10-11 03:54:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:07,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:07,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:07,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:07,036 INFO L87 Difference]: Start difference. First operand 5278 states and 8063 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:07,249 INFO L93 Difference]: Finished difference Result 14008 states and 22181 transitions. [2024-10-11 03:54:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:07,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-11 03:54:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:07,310 INFO L225 Difference]: With dead ends: 14008 [2024-10-11 03:54:07,311 INFO L226 Difference]: Without dead ends: 12267 [2024-10-11 03:54:07,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:54:07,322 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 1102 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:07,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1540 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12267 states. [2024-10-11 03:54:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12267 to 8789. [2024-10-11 03:54:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8789 states, 8788 states have (on average 1.5595129722348657) internal successors, (13705), 8788 states have internal predecessors, (13705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8789 states to 8789 states and 13705 transitions. [2024-10-11 03:54:07,602 INFO L78 Accepts]: Start accepts. Automaton has 8789 states and 13705 transitions. Word has length 161 [2024-10-11 03:54:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:07,602 INFO L471 AbstractCegarLoop]: Abstraction has 8789 states and 13705 transitions. [2024-10-11 03:54:07,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 8789 states and 13705 transitions. [2024-10-11 03:54:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 03:54:07,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:07,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:07,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:54:07,608 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:07,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1702363423, now seen corresponding path program 1 times [2024-10-11 03:54:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095839652] [2024-10-11 03:54:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095839652] [2024-10-11 03:54:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095839652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:07,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59683594] [2024-10-11 03:54:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:07,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:07,728 INFO L87 Difference]: Start difference. First operand 8789 states and 13705 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:07,877 INFO L93 Difference]: Finished difference Result 22406 states and 35344 transitions. [2024-10-11 03:54:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-11 03:54:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:07,914 INFO L225 Difference]: With dead ends: 22406 [2024-10-11 03:54:07,914 INFO L226 Difference]: Without dead ends: 15304 [2024-10-11 03:54:07,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:07,933 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 300 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:07,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 795 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15304 states. [2024-10-11 03:54:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15304 to 15302. [2024-10-11 03:54:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15302 states, 15301 states have (on average 1.558198810535259) internal successors, (23842), 15301 states have internal predecessors, (23842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15302 states to 15302 states and 23842 transitions. [2024-10-11 03:54:08,334 INFO L78 Accepts]: Start accepts. Automaton has 15302 states and 23842 transitions. Word has length 161 [2024-10-11 03:54:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:08,334 INFO L471 AbstractCegarLoop]: Abstraction has 15302 states and 23842 transitions. [2024-10-11 03:54:08,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 15302 states and 23842 transitions. [2024-10-11 03:54:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 03:54:08,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:08,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:08,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:54:08,342 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:08,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:08,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1015953447, now seen corresponding path program 1 times [2024-10-11 03:54:08,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:08,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224805134] [2024-10-11 03:54:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:08,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224805134] [2024-10-11 03:54:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224805134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:08,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716230606] [2024-10-11 03:54:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:08,854 INFO L87 Difference]: Start difference. First operand 15302 states and 23842 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:09,199 INFO L93 Difference]: Finished difference Result 40237 states and 62715 transitions. [2024-10-11 03:54:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-11 03:54:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:09,257 INFO L225 Difference]: With dead ends: 40237 [2024-10-11 03:54:09,257 INFO L226 Difference]: Without dead ends: 24961 [2024-10-11 03:54:09,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:09,289 INFO L432 NwaCegarLoop]: 848 mSDtfsCounter, 424 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:09,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 2115 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24961 states. [2024-10-11 03:54:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24961 to 24959. [2024-10-11 03:54:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24959 states, 24958 states have (on average 1.5457568715441943) internal successors, (38579), 24958 states have internal predecessors, (38579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24959 states to 24959 states and 38579 transitions. [2024-10-11 03:54:09,891 INFO L78 Accepts]: Start accepts. Automaton has 24959 states and 38579 transitions. Word has length 161 [2024-10-11 03:54:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:09,892 INFO L471 AbstractCegarLoop]: Abstraction has 24959 states and 38579 transitions. [2024-10-11 03:54:09,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 24959 states and 38579 transitions. [2024-10-11 03:54:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 03:54:09,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:09,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:09,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:54:09,903 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:09,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2075358350, now seen corresponding path program 1 times [2024-10-11 03:54:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890788980] [2024-10-11 03:54:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890788980] [2024-10-11 03:54:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890788980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:10,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:10,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649356696] [2024-10-11 03:54:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:10,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:10,012 INFO L87 Difference]: Start difference. First operand 24959 states and 38579 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:10,413 INFO L93 Difference]: Finished difference Result 63563 states and 98137 transitions. [2024-10-11 03:54:10,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:10,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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-10-11 03:54:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:10,487 INFO L225 Difference]: With dead ends: 63563 [2024-10-11 03:54:10,488 INFO L226 Difference]: Without dead ends: 38995 [2024-10-11 03:54:10,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:10,516 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 418 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:10,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1017 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38995 states. [2024-10-11 03:54:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38995 to 38993. [2024-10-11 03:54:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38993 states, 38992 states have (on average 1.5266208453016004) internal successors, (59526), 38992 states have internal predecessors, (59526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38993 states to 38993 states and 59526 transitions. [2024-10-11 03:54:11,366 INFO L78 Accepts]: Start accepts. Automaton has 38993 states and 59526 transitions. Word has length 163 [2024-10-11 03:54:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:11,367 INFO L471 AbstractCegarLoop]: Abstraction has 38993 states and 59526 transitions. [2024-10-11 03:54:11,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 38993 states and 59526 transitions. [2024-10-11 03:54:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 03:54:11,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:11,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:54:11,382 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:11,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1341662232, now seen corresponding path program 1 times [2024-10-11 03:54:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103501208] [2024-10-11 03:54:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:11,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:11,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103501208] [2024-10-11 03:54:11,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103501208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:11,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:11,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564794663] [2024-10-11 03:54:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:11,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:11,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:11,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:11,664 INFO L87 Difference]: Start difference. First operand 38993 states and 59526 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:12,229 INFO L93 Difference]: Finished difference Result 107429 states and 165485 transitions. [2024-10-11 03:54:12,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:12,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-10-11 03:54:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:12,458 INFO L225 Difference]: With dead ends: 107429 [2024-10-11 03:54:12,459 INFO L226 Difference]: Without dead ends: 68767 [2024-10-11 03:54:12,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:12,519 INFO L432 NwaCegarLoop]: 681 mSDtfsCounter, 301 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:12,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1034 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68767 states. [2024-10-11 03:54:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68767 to 63149. [2024-10-11 03:54:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63149 states, 63148 states have (on average 1.5484417558750871) internal successors, (97781), 63148 states have internal predecessors, (97781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63149 states to 63149 states and 97781 transitions. [2024-10-11 03:54:14,013 INFO L78 Accepts]: Start accepts. Automaton has 63149 states and 97781 transitions. Word has length 167 [2024-10-11 03:54:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:14,013 INFO L471 AbstractCegarLoop]: Abstraction has 63149 states and 97781 transitions. [2024-10-11 03:54:14,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 63149 states and 97781 transitions. [2024-10-11 03:54:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:54:14,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:14,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:14,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:54:14,031 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:14,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash -974538840, now seen corresponding path program 1 times [2024-10-11 03:54:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:14,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78661060] [2024-10-11 03:54:14,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:14,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78661060] [2024-10-11 03:54:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78661060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:14,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:14,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:54:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708265992] [2024-10-11 03:54:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:54:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:54:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:14,217 INFO L87 Difference]: Start difference. First operand 63149 states and 97781 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:15,677 INFO L93 Difference]: Finished difference Result 228817 states and 360579 transitions. [2024-10-11 03:54:15,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:54:15,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:54:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:16,389 INFO L225 Difference]: With dead ends: 228817 [2024-10-11 03:54:16,389 INFO L226 Difference]: Without dead ends: 173559 [2024-10-11 03:54:16,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:54:16,460 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 1446 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:16,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1914 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:54:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173559 states. [2024-10-11 03:54:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173559 to 102365. [2024-10-11 03:54:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102365 states, 102364 states have (on average 1.5496561291078894) internal successors, (158629), 102364 states have internal predecessors, (158629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102365 states to 102365 states and 158629 transitions. [2024-10-11 03:54:18,835 INFO L78 Accepts]: Start accepts. Automaton has 102365 states and 158629 transitions. Word has length 168 [2024-10-11 03:54:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:18,836 INFO L471 AbstractCegarLoop]: Abstraction has 102365 states and 158629 transitions. [2024-10-11 03:54:18,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 102365 states and 158629 transitions. [2024-10-11 03:54:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:54:18,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:18,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:18,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:54:18,852 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:18,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:18,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1398464276, now seen corresponding path program 1 times [2024-10-11 03:54:18,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:18,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111245592] [2024-10-11 03:54:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:19,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:19,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111245592] [2024-10-11 03:54:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111245592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:19,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:19,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:19,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821592272] [2024-10-11 03:54:19,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:19,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:19,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:19,345 INFO L87 Difference]: Start difference. First operand 102365 states and 158629 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:21,534 INFO L93 Difference]: Finished difference Result 469841 states and 726638 transitions. [2024-10-11 03:54:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:54:21,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:54:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:23,005 INFO L225 Difference]: With dead ends: 469841 [2024-10-11 03:54:23,006 INFO L226 Difference]: Without dead ends: 367514 [2024-10-11 03:54:23,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:54:23,131 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 1349 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:23,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 2061 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:54:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367514 states. [2024-10-11 03:54:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367514 to 183801. [2024-10-11 03:54:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183801 states, 183800 states have (on average 1.5323286180631122) internal successors, (281642), 183800 states have internal predecessors, (281642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183801 states to 183801 states and 281642 transitions. [2024-10-11 03:54:28,261 INFO L78 Accepts]: Start accepts. Automaton has 183801 states and 281642 transitions. Word has length 168 [2024-10-11 03:54:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:28,261 INFO L471 AbstractCegarLoop]: Abstraction has 183801 states and 281642 transitions. [2024-10-11 03:54:28,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 183801 states and 281642 transitions. [2024-10-11 03:54:28,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 03:54:28,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:28,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:28,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:54:28,278 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:28,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash -138200570, now seen corresponding path program 1 times [2024-10-11 03:54:28,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:28,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734893621] [2024-10-11 03:54:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:28,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734893621] [2024-10-11 03:54:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734893621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:28,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:28,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891245301] [2024-10-11 03:54:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:28,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:28,363 INFO L87 Difference]: Start difference. First operand 183801 states and 281642 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:30,142 INFO L93 Difference]: Finished difference Result 367504 states and 563157 transitions. [2024-10-11 03:54:30,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:30,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-10-11 03:54:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:30,533 INFO L225 Difference]: With dead ends: 367504 [2024-10-11 03:54:30,534 INFO L226 Difference]: Without dead ends: 183807 [2024-10-11 03:54:30,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:30,653 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:30,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 967 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183807 states. [2024-10-11 03:54:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183807 to 183807. [2024-10-11 03:54:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183807 states, 183806 states have (on average 1.5323112411999609) internal successors, (281648), 183806 states have internal predecessors, (281648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183807 states to 183807 states and 281648 transitions. [2024-10-11 03:54:33,846 INFO L78 Accepts]: Start accepts. Automaton has 183807 states and 281648 transitions. Word has length 169 [2024-10-11 03:54:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:33,846 INFO L471 AbstractCegarLoop]: Abstraction has 183807 states and 281648 transitions. [2024-10-11 03:54:33,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 183807 states and 281648 transitions. [2024-10-11 03:54:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:54:33,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:33,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:54:33,864 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:33,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1299346743, now seen corresponding path program 1 times [2024-10-11 03:54:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367286138] [2024-10-11 03:54:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:33,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-10-11 03:54:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:33,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367286138] [2024-10-11 03:54:33,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367286138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:33,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:33,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:54:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976059077] [2024-10-11 03:54:33,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:33,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:54:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:33,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:54:33,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:33,969 INFO L87 Difference]: Start difference. First operand 183807 states and 281648 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:36,078 INFO L93 Difference]: Finished difference Result 480835 states and 735402 transitions. [2024-10-11 03:54:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:54:36,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:54:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:36,645 INFO L225 Difference]: With dead ends: 480835 [2024-10-11 03:54:36,645 INFO L226 Difference]: Without dead ends: 297773 [2024-10-11 03:54:36,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:54:36,798 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 400 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:36,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1339 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297773 states. [2024-10-11 03:54:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297773 to 297771. [2024-10-11 03:54:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297771 states, 297770 states have (on average 1.5118379957685462) internal successors, (450180), 297770 states have internal predecessors, (450180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297771 states to 297771 states and 450180 transitions. [2024-10-11 03:54:43,101 INFO L78 Accepts]: Start accepts. Automaton has 297771 states and 450180 transitions. Word has length 170 [2024-10-11 03:54:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:43,102 INFO L471 AbstractCegarLoop]: Abstraction has 297771 states and 450180 transitions. [2024-10-11 03:54:43,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 297771 states and 450180 transitions. [2024-10-11 03:54:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:54:43,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:43,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:43,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:54:43,127 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:43,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2047181946, now seen corresponding path program 1 times [2024-10-11 03:54:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:43,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732248289] [2024-10-11 03:54:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732248289] [2024-10-11 03:54:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732248289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:43,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:54:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924306136] [2024-10-11 03:54:43,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:43,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:54:43,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:43,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:54:43,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:43,529 INFO L87 Difference]: Start difference. First operand 297771 states and 450180 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:54:45,815 INFO L93 Difference]: Finished difference Result 562344 states and 850055 transitions. [2024-10-11 03:54:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:54:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:54:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:54:47,284 INFO L225 Difference]: With dead ends: 562344 [2024-10-11 03:54:47,284 INFO L226 Difference]: Without dead ends: 265242 [2024-10-11 03:54:47,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:54:47,432 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 15 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:54:47,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:54:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265242 states. [2024-10-11 03:54:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265242 to 265242. [2024-10-11 03:54:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265242 states, 265241 states have (on average 1.5105055402445324) internal successors, (400648), 265241 states have internal predecessors, (400648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265242 states to 265242 states and 400648 transitions. [2024-10-11 03:54:52,488 INFO L78 Accepts]: Start accepts. Automaton has 265242 states and 400648 transitions. Word has length 170 [2024-10-11 03:54:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:54:52,488 INFO L471 AbstractCegarLoop]: Abstraction has 265242 states and 400648 transitions. [2024-10-11 03:54:52,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:54:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 265242 states and 400648 transitions. [2024-10-11 03:54:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 03:54:52,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:54:52,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:54:52,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:54:52,508 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:54:52,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:54:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash -668745085, now seen corresponding path program 1 times [2024-10-11 03:54:52,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:54:52,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263159102] [2024-10-11 03:54:52,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:54:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:54:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:54:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:54:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:54:52,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263159102] [2024-10-11 03:54:52,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263159102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:54:52,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:54:52,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:54:52,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957650752] [2024-10-11 03:54:52,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:54:52,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:54:52,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:54:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:54:52,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:54:52,788 INFO L87 Difference]: Start difference. First operand 265242 states and 400648 transitions. Second operand has 8 states, 8 states have (on average 21.875) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)