./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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-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 4a068220cd9a63125e810935e79eeb0e481ecd288491865590be5286d46acb22 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:33:56,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:33:56,633 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:33:56,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:33:56,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:33:56,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:33:56,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:33:56,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:33:56,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:33:56,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:33:56,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:33:56,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:33:56,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:33:56,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:33:56,681 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:33:56,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:33:56,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:33:56,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:33:56,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:33:56,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:33:56,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:33:56,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:33:56,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:33:56,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:33:56,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:33:56,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:33:56,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:33:56,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:33:56,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:33:56,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:33:56,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:33:56,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:33:56,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:33:56,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:33:56,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:33:56,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:33:56,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:33:56,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:33:56,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:33:56,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:33:56,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:33:56,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:33:56,691 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 -> 4a068220cd9a63125e810935e79eeb0e481ecd288491865590be5286d46acb22 [2024-10-11 03:33:56,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:33:56,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:33:56,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:33:56,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:33:56,999 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:33:57,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-11 03:33:58,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:33:58,687 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:33:58,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-11 03:33:58,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0bedc73fb/bc2913b46d674eda926d5722fcbcc8b0/FLAG3a01c61ec [2024-10-11 03:33:58,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0bedc73fb/bc2913b46d674eda926d5722fcbcc8b0 [2024-10-11 03:33:58,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:33:58,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:33:58,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:33:58,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:33:58,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:33:58,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:33:58" (1/1) ... [2024-10-11 03:33:58,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a4535d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:58, skipping insertion in model container [2024-10-11 03:33:58,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:33:58" (1/1) ... [2024-10-11 03:33:58,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:33:59,052 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2024-10-11 03:33:59,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:33:59,177 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:33:59,217 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2024-10-11 03:33:59,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:33:59,259 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:33:59,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59 WrapperNode [2024-10-11 03:33:59,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:33:59,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:33:59,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:33:59,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:33:59,268 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:33:59" (1/1) ... [2024-10-11 03:33:59,278 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:33:59" (1/1) ... [2024-10-11 03:33:59,320 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 633 [2024-10-11 03:33:59,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:33:59,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:33:59,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:33:59,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:33:59,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,388 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:33:59,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:33:59,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:33:59,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:33:59,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:33:59,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (1/1) ... [2024-10-11 03:33:59,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:33:59,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:33:59,469 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:33:59,475 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:33:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:33:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:33:59,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:33:59,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:33:59,663 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:33:59,665 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:34:00,299 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-11 03:34:00,299 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:34:00,343 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:34:00,344 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:34:00,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:34:00 BoogieIcfgContainer [2024-10-11 03:34:00,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:34:00,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:34:00,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:34:00,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:34:00,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:33:58" (1/3) ... [2024-10-11 03:34:00,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b6aa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:34:00, skipping insertion in model container [2024-10-11 03:34:00,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:33:59" (2/3) ... [2024-10-11 03:34:00,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b6aa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:34:00, skipping insertion in model container [2024-10-11 03:34:00,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:34:00" (3/3) ... [2024-10-11 03:34:00,353 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-11 03:34:00,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:34:00,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:34:00,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:34:00,437 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;@2201ac1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:34:00,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:34:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 131 states have (on average 1.786259541984733) internal successors, (234), 132 states have internal predecessors, (234), 0 states have call successors, (0), 0 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:34:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:34:00,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:00,457 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] [2024-10-11 03:34:00,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:00,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash -257930743, now seen corresponding path program 1 times [2024-10-11 03:34:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079434970] [2024-10-11 03:34:00,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:01,037 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:34:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079434970] [2024-10-11 03:34:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079434970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:01,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:01,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:01,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555801426] [2024-10-11 03:34:01,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:01,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:01,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:01,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:01,076 INFO L87 Difference]: Start difference. First operand has 133 states, 131 states have (on average 1.786259541984733) internal successors, (234), 132 states have internal predecessors, (234), 0 states have call successors, (0), 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 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:34:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:01,190 INFO L93 Difference]: Finished difference Result 284 states and 487 transitions. [2024-10-11 03:34:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:34:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-11 03:34:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:01,202 INFO L225 Difference]: With dead ends: 284 [2024-10-11 03:34:01,203 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 03:34:01,206 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:34:01,209 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 130 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:01,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 404 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 03:34:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2024-10-11 03:34:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.583756345177665) internal successors, (312), 197 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:34:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 312 transitions. [2024-10-11 03:34:01,262 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 312 transitions. Word has length 56 [2024-10-11 03:34:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:01,263 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 312 transitions. [2024-10-11 03:34:01,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:34:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 312 transitions. [2024-10-11 03:34:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:34:01,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:01,268 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] [2024-10-11 03:34:01,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:34:01,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:01,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1691975926, now seen corresponding path program 1 times [2024-10-11 03:34:01,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:01,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728481092] [2024-10-11 03:34:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:01,425 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:34:01,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:01,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728481092] [2024-10-11 03:34:01,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728481092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:01,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406867083] [2024-10-11 03:34:01,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:01,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:01,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:01,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:01,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:01,431 INFO L87 Difference]: Start difference. First operand 198 states and 312 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:34:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:01,481 INFO L93 Difference]: Finished difference Result 474 states and 768 transitions. [2024-10-11 03:34:01,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:34:01,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-11 03:34:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:01,486 INFO L225 Difference]: With dead ends: 474 [2024-10-11 03:34:01,488 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 03:34:01,489 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:34:01,490 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:01,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 03:34:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-10-11 03:34:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.607361963190184) internal successors, (524), 326 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:34:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 524 transitions. [2024-10-11 03:34:01,520 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 524 transitions. Word has length 58 [2024-10-11 03:34:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:01,521 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 524 transitions. [2024-10-11 03:34:01,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:34:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 524 transitions. [2024-10-11 03:34:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:34:01,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:01,523 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] [2024-10-11 03:34:01,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:34:01,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:01,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash -62203140, now seen corresponding path program 1 times [2024-10-11 03:34:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500357472] [2024-10-11 03:34:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:01,704 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:34:01,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500357472] [2024-10-11 03:34:01,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500357472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:01,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:01,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32898620] [2024-10-11 03:34:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:01,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:01,710 INFO L87 Difference]: Start difference. First operand 327 states and 524 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:34:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:01,754 INFO L93 Difference]: Finished difference Result 602 states and 980 transitions. [2024-10-11 03:34:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:34:01,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-11 03:34:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:01,758 INFO L225 Difference]: With dead ends: 602 [2024-10-11 03:34:01,759 INFO L226 Difference]: Without dead ends: 457 [2024-10-11 03:34:01,761 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:34:01,763 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 111 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:01,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 442 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-11 03:34:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2024-10-11 03:34:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.6167400881057268) internal successors, (734), 454 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 734 transitions. [2024-10-11 03:34:01,781 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 734 transitions. Word has length 60 [2024-10-11 03:34:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:01,781 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 734 transitions. [2024-10-11 03:34:01,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:34:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 734 transitions. [2024-10-11 03:34:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:34:01,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:01,783 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] [2024-10-11 03:34:01,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:34:01,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:01,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:01,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1225726807, now seen corresponding path program 1 times [2024-10-11 03:34:01,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:01,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727970915] [2024-10-11 03:34:01,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:01,936 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:34:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727970915] [2024-10-11 03:34:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727970915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:01,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:01,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393827245] [2024-10-11 03:34:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:01,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:01,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:01,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:01,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:01,941 INFO L87 Difference]: Start difference. First operand 455 states and 734 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:34:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:01,975 INFO L93 Difference]: Finished difference Result 1171 states and 1910 transitions. [2024-10-11 03:34:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:34:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-11 03:34:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:01,979 INFO L225 Difference]: With dead ends: 1171 [2024-10-11 03:34:01,979 INFO L226 Difference]: Without dead ends: 792 [2024-10-11 03:34:01,981 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:34:01,982 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 105 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:01,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 378 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-10-11 03:34:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2024-10-11 03:34:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.6172370088719898) internal successors, (1276), 789 states have internal predecessors, (1276), 0 states have call successors, (0), 0 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:34:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1276 transitions. [2024-10-11 03:34:02,010 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1276 transitions. Word has length 60 [2024-10-11 03:34:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:02,011 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1276 transitions. [2024-10-11 03:34:02,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:34:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1276 transitions. [2024-10-11 03:34:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:34:02,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:02,017 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] [2024-10-11 03:34:02,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:34:02,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:02,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash -792993450, now seen corresponding path program 1 times [2024-10-11 03:34:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:02,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762078827] [2024-10-11 03:34:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:02,246 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:34:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762078827] [2024-10-11 03:34:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762078827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:02,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:02,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:34:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251097379] [2024-10-11 03:34:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:02,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:34:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:02,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:34:02,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:34:02,248 INFO L87 Difference]: Start difference. First operand 790 states and 1276 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:34:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:02,438 INFO L93 Difference]: Finished difference Result 3567 states and 5887 transitions. [2024-10-11 03:34:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:34:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:34:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:02,451 INFO L225 Difference]: With dead ends: 3567 [2024-10-11 03:34:02,452 INFO L226 Difference]: Without dead ends: 2853 [2024-10-11 03:34:02,454 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:34:02,457 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 881 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:02,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1258 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2024-10-11 03:34:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1431. [2024-10-11 03:34:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1430 states have (on average 1.6237762237762239) internal successors, (2322), 1430 states have internal predecessors, (2322), 0 states have call successors, (0), 0 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:34:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2322 transitions. [2024-10-11 03:34:02,513 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2322 transitions. Word has length 62 [2024-10-11 03:34:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:02,514 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 2322 transitions. [2024-10-11 03:34:02,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:34:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2322 transitions. [2024-10-11 03:34:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:34:02,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:02,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:02,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:34:02,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:02,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1124502626, now seen corresponding path program 1 times [2024-10-11 03:34:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068147500] [2024-10-11 03:34:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:02,640 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:34:02,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:02,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068147500] [2024-10-11 03:34:02,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068147500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:34:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715056044] [2024-10-11 03:34:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:02,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:34:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:34:02,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:34:02,643 INFO L87 Difference]: Start difference. First operand 1431 states and 2322 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:02,728 INFO L93 Difference]: Finished difference Result 4198 states and 6909 transitions. [2024-10-11 03:34:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:34:02,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 03:34:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:02,742 INFO L225 Difference]: With dead ends: 4198 [2024-10-11 03:34:02,742 INFO L226 Difference]: Without dead ends: 2845 [2024-10-11 03:34:02,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:34:02,747 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 379 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:02,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 605 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2024-10-11 03:34:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2126. [2024-10-11 03:34:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 2125 states have (on average 1.6305882352941177) internal successors, (3465), 2125 states have internal predecessors, (3465), 0 states have call successors, (0), 0 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:34:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3465 transitions. [2024-10-11 03:34:02,808 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3465 transitions. Word has length 63 [2024-10-11 03:34:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:02,808 INFO L471 AbstractCegarLoop]: Abstraction has 2126 states and 3465 transitions. [2024-10-11 03:34:02,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3465 transitions. [2024-10-11 03:34:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:34:02,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:02,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:02,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:34:02,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:02,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash -808788401, now seen corresponding path program 1 times [2024-10-11 03:34:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:02,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847141424] [2024-10-11 03:34:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:02,895 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:34:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847141424] [2024-10-11 03:34:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847141424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:02,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:02,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122730071] [2024-10-11 03:34:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:02,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:02,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:02,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:02,900 INFO L87 Difference]: Start difference. First operand 2126 states and 3465 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:02,934 INFO L93 Difference]: Finished difference Result 4120 states and 6751 transitions. [2024-10-11 03:34:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:34:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 03:34:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:02,945 INFO L225 Difference]: With dead ends: 4120 [2024-10-11 03:34:02,945 INFO L226 Difference]: Without dead ends: 2978 [2024-10-11 03:34:02,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:02,950 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 106 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:02,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 424 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2024-10-11 03:34:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2976. [2024-10-11 03:34:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2975 states have (on average 1.6258823529411766) internal successors, (4837), 2975 states have internal predecessors, (4837), 0 states have call successors, (0), 0 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:34:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4837 transitions. [2024-10-11 03:34:03,030 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4837 transitions. Word has length 63 [2024-10-11 03:34:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:03,030 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 4837 transitions. [2024-10-11 03:34:03,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4837 transitions. [2024-10-11 03:34:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:34:03,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:03,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:03,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:34:03,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:03,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:03,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1440634225, now seen corresponding path program 1 times [2024-10-11 03:34:03,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:03,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497883557] [2024-10-11 03:34:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:03,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:03,105 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:34:03,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:03,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497883557] [2024-10-11 03:34:03,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497883557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:03,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:03,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:03,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377997646] [2024-10-11 03:34:03,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:03,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:03,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:03,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:03,107 INFO L87 Difference]: Start difference. First operand 2976 states and 4837 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:03,157 INFO L93 Difference]: Finished difference Result 6398 states and 10549 transitions. [2024-10-11 03:34:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:34:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 03:34:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:03,172 INFO L225 Difference]: With dead ends: 6398 [2024-10-11 03:34:03,172 INFO L226 Difference]: Without dead ends: 4312 [2024-10-11 03:34:03,176 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:34:03,178 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 116 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:03,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 465 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2024-10-11 03:34:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 4310. [2024-10-11 03:34:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 4309 states have (on average 1.633325597586447) internal successors, (7038), 4309 states have internal predecessors, (7038), 0 states have call successors, (0), 0 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:34:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 7038 transitions. [2024-10-11 03:34:03,268 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 7038 transitions. Word has length 63 [2024-10-11 03:34:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:03,268 INFO L471 AbstractCegarLoop]: Abstraction has 4310 states and 7038 transitions. [2024-10-11 03:34:03,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 7038 transitions. [2024-10-11 03:34:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:34:03,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:03,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:03,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:34:03,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:03,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash 441896861, now seen corresponding path program 1 times [2024-10-11 03:34:03,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:03,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296341599] [2024-10-11 03:34:03,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:03,369 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:34:03,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:03,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296341599] [2024-10-11 03:34:03,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296341599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:03,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:03,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:34:03,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416894290] [2024-10-11 03:34:03,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:03,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:34:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:03,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:34:03,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:34:03,372 INFO L87 Difference]: Start difference. First operand 4310 states and 7038 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:03,487 INFO L93 Difference]: Finished difference Result 13701 states and 22481 transitions. [2024-10-11 03:34:03,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:34:03,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 03:34:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:03,553 INFO L225 Difference]: With dead ends: 13701 [2024-10-11 03:34:03,553 INFO L226 Difference]: Without dead ends: 9472 [2024-10-11 03:34:03,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:34:03,560 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 377 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:03,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 679 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2024-10-11 03:34:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 6862. [2024-10-11 03:34:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6862 states, 6861 states have (on average 1.6265850459116746) internal successors, (11160), 6861 states have internal predecessors, (11160), 0 states have call successors, (0), 0 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:34:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 11160 transitions. [2024-10-11 03:34:03,697 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 11160 transitions. Word has length 64 [2024-10-11 03:34:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:03,697 INFO L471 AbstractCegarLoop]: Abstraction has 6862 states and 11160 transitions. [2024-10-11 03:34:03,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 11160 transitions. [2024-10-11 03:34:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:34:03,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:03,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:03,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:34:03,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:03,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:03,699 INFO L85 PathProgramCache]: Analyzing trace with hash 760512649, now seen corresponding path program 1 times [2024-10-11 03:34:03,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:03,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9055440] [2024-10-11 03:34:03,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:03,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:03,792 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:34:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:03,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9055440] [2024-10-11 03:34:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9055440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:03,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:03,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:34:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131666495] [2024-10-11 03:34:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:03,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:34:03,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:03,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:34:03,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:34:03,795 INFO L87 Difference]: Start difference. First operand 6862 states and 11160 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:03,931 INFO L93 Difference]: Finished difference Result 21433 states and 34993 transitions. [2024-10-11 03:34:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:34:03,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 03:34:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:04,014 INFO L225 Difference]: With dead ends: 21433 [2024-10-11 03:34:04,015 INFO L226 Difference]: Without dead ends: 14652 [2024-10-11 03:34:04,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:34:04,028 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 375 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:04,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 661 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14652 states. [2024-10-11 03:34:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14652 to 10714. [2024-10-11 03:34:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10714 states, 10713 states have (on average 1.6191542985158218) internal successors, (17346), 10713 states have internal predecessors, (17346), 0 states have call successors, (0), 0 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:34:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10714 states to 10714 states and 17346 transitions. [2024-10-11 03:34:04,276 INFO L78 Accepts]: Start accepts. Automaton has 10714 states and 17346 transitions. Word has length 65 [2024-10-11 03:34:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:04,276 INFO L471 AbstractCegarLoop]: Abstraction has 10714 states and 17346 transitions. [2024-10-11 03:34:04,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 10714 states and 17346 transitions. [2024-10-11 03:34:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:34:04,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:04,277 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] [2024-10-11 03:34:04,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:34:04,278 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:04,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash -809096294, now seen corresponding path program 1 times [2024-10-11 03:34:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:04,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085891109] [2024-10-11 03:34:04,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:04,495 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:34:04,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085891109] [2024-10-11 03:34:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085891109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:34:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866501076] [2024-10-11 03:34:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:04,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:34:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:04,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:34:04,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:34:04,498 INFO L87 Difference]: Start difference. First operand 10714 states and 17346 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:34:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:04,671 INFO L93 Difference]: Finished difference Result 21349 states and 34582 transitions. [2024-10-11 03:34:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:34:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-11 03:34:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:04,692 INFO L225 Difference]: With dead ends: 21349 [2024-10-11 03:34:04,693 INFO L226 Difference]: Without dead ends: 10716 [2024-10-11 03:34:04,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:34:04,708 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 209 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:04,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 549 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2024-10-11 03:34:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 10714. [2024-10-11 03:34:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10714 states, 10713 states have (on average 1.6074862316811351) internal successors, (17221), 10713 states have internal predecessors, (17221), 0 states have call successors, (0), 0 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:34:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10714 states to 10714 states and 17221 transitions. [2024-10-11 03:34:04,874 INFO L78 Accepts]: Start accepts. Automaton has 10714 states and 17221 transitions. Word has length 67 [2024-10-11 03:34:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:04,874 INFO L471 AbstractCegarLoop]: Abstraction has 10714 states and 17221 transitions. [2024-10-11 03:34:04,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:34:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 10714 states and 17221 transitions. [2024-10-11 03:34:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:34:04,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:04,876 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] [2024-10-11 03:34:04,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:34:04,876 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:04,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1815177743, now seen corresponding path program 1 times [2024-10-11 03:34:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:04,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262529643] [2024-10-11 03:34:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:05,099 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:34:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262529643] [2024-10-11 03:34:05,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262529643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:05,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:34:05,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396513194] [2024-10-11 03:34:05,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:05,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:34:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:05,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:34:05,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:34:05,101 INFO L87 Difference]: Start difference. First operand 10714 states and 17221 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:34:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:05,261 INFO L93 Difference]: Finished difference Result 30659 states and 49436 transitions. [2024-10-11 03:34:05,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:34:05,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-11 03:34:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:05,299 INFO L225 Difference]: With dead ends: 30659 [2024-10-11 03:34:05,299 INFO L226 Difference]: Without dead ends: 20026 [2024-10-11 03:34:05,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:34:05,318 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 205 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:05,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 558 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20026 states. [2024-10-11 03:34:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20026 to 20024. [2024-10-11 03:34:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20024 states, 20023 states have (on average 1.5949657893422564) internal successors, (31936), 20023 states have internal predecessors, (31936), 0 states have call successors, (0), 0 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:34:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20024 states to 20024 states and 31936 transitions. [2024-10-11 03:34:05,701 INFO L78 Accepts]: Start accepts. Automaton has 20024 states and 31936 transitions. Word has length 70 [2024-10-11 03:34:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:05,702 INFO L471 AbstractCegarLoop]: Abstraction has 20024 states and 31936 transitions. [2024-10-11 03:34:05,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:34:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 20024 states and 31936 transitions. [2024-10-11 03:34:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:34:05,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:05,703 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] [2024-10-11 03:34:05,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:34:05,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:05,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash 434025879, now seen corresponding path program 1 times [2024-10-11 03:34:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:05,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042646602] [2024-10-11 03:34:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:06,115 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:34:06,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:06,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042646602] [2024-10-11 03:34:06,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042646602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:06,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:06,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:34:06,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830726156] [2024-10-11 03:34:06,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:06,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:34:06,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:06,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:34:06,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:34:06,118 INFO L87 Difference]: Start difference. First operand 20024 states and 31936 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:34:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:06,237 INFO L93 Difference]: Finished difference Result 20750 states and 33023 transitions. [2024-10-11 03:34:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:34:06,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-11 03:34:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:06,291 INFO L225 Difference]: With dead ends: 20750 [2024-10-11 03:34:06,291 INFO L226 Difference]: Without dead ends: 20748 [2024-10-11 03:34:06,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:34:06,303 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:06,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 782 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20748 states. [2024-10-11 03:34:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20748 to 20748. [2024-10-11 03:34:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20748 states, 20747 states have (on average 1.5737697016436112) internal successors, (32651), 20747 states have internal predecessors, (32651), 0 states have call successors, (0), 0 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:34:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20748 states to 20748 states and 32651 transitions. [2024-10-11 03:34:06,733 INFO L78 Accepts]: Start accepts. Automaton has 20748 states and 32651 transitions. Word has length 71 [2024-10-11 03:34:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:06,733 INFO L471 AbstractCegarLoop]: Abstraction has 20748 states and 32651 transitions. [2024-10-11 03:34:06,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:34:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 20748 states and 32651 transitions. [2024-10-11 03:34:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:34:06,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:06,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:06,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:34:06,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:06,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:06,736 INFO L85 PathProgramCache]: Analyzing trace with hash 575576521, now seen corresponding path program 1 times [2024-10-11 03:34:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:06,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70767379] [2024-10-11 03:34:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:34:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70767379] [2024-10-11 03:34:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70767379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:06,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:06,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:34:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952445503] [2024-10-11 03:34:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:06,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:34:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:34:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:34:06,887 INFO L87 Difference]: Start difference. First operand 20748 states and 32651 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:07,157 INFO L93 Difference]: Finished difference Result 50556 states and 79853 transitions. [2024-10-11 03:34:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:34:07,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:34:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:07,220 INFO L225 Difference]: With dead ends: 50556 [2024-10-11 03:34:07,221 INFO L226 Difference]: Without dead ends: 40764 [2024-10-11 03:34:07,247 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:34:07,247 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 479 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:07,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 934 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40764 states. [2024-10-11 03:34:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40764 to 31834. [2024-10-11 03:34:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31834 states, 31833 states have (on average 1.5725504979109728) internal successors, (50059), 31833 states have internal predecessors, (50059), 0 states have call successors, (0), 0 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:34:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31834 states to 31834 states and 50059 transitions. [2024-10-11 03:34:07,956 INFO L78 Accepts]: Start accepts. Automaton has 31834 states and 50059 transitions. Word has length 92 [2024-10-11 03:34:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:07,956 INFO L471 AbstractCegarLoop]: Abstraction has 31834 states and 50059 transitions. [2024-10-11 03:34:07,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 31834 states and 50059 transitions. [2024-10-11 03:34:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:34:07,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:07,959 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:07,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:34:07,960 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:07,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1946475532, now seen corresponding path program 1 times [2024-10-11 03:34:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:07,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112799893] [2024-10-11 03:34:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:07,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:34:08,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:08,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112799893] [2024-10-11 03:34:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112799893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:08,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:34:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624701391] [2024-10-11 03:34:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:08,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:34:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:34:08,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:34:08,111 INFO L87 Difference]: Start difference. First operand 31834 states and 50059 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:08,580 INFO L93 Difference]: Finished difference Result 54448 states and 86017 transitions. [2024-10-11 03:34:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:34:08,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:34:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:08,874 INFO L225 Difference]: With dead ends: 54448 [2024-10-11 03:34:08,874 INFO L226 Difference]: Without dead ends: 44656 [2024-10-11 03:34:08,911 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:34:08,912 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 478 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:08,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 870 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44656 states. [2024-10-11 03:34:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44656 to 43066. [2024-10-11 03:34:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43066 states, 43065 states have (on average 1.5734587251828631) internal successors, (67761), 43065 states have internal predecessors, (67761), 0 states have call successors, (0), 0 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:34:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43066 states to 43066 states and 67761 transitions. [2024-10-11 03:34:09,786 INFO L78 Accepts]: Start accepts. Automaton has 43066 states and 67761 transitions. Word has length 92 [2024-10-11 03:34:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:09,786 INFO L471 AbstractCegarLoop]: Abstraction has 43066 states and 67761 transitions. [2024-10-11 03:34:09,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 43066 states and 67761 transitions. [2024-10-11 03:34:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:34:09,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:09,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:09,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:34:09,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:09,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:09,791 INFO L85 PathProgramCache]: Analyzing trace with hash 621891858, now seen corresponding path program 1 times [2024-10-11 03:34:09,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:09,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719905634] [2024-10-11 03:34:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:34:09,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:09,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719905634] [2024-10-11 03:34:09,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719905634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:09,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:09,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:34:09,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460194210] [2024-10-11 03:34:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:09,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:34:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:34:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:34:09,973 INFO L87 Difference]: Start difference. First operand 43066 states and 67761 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:34:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:10,422 INFO L93 Difference]: Finished difference Result 61062 states and 96645 transitions. [2024-10-11 03:34:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:34:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:34:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:10,506 INFO L225 Difference]: With dead ends: 61062 [2024-10-11 03:34:10,507 INFO L226 Difference]: Without dead ends: 51040 [2024-10-11 03:34:10,537 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:34:10,538 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 478 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:10,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 918 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:34:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51040 states. [2024-10-11 03:34:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51040 to 49450. [2024-10-11 03:34:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49450 states, 49449 states have (on average 1.5763513923436268) internal successors, (77949), 49449 states have internal predecessors, (77949), 0 states have call successors, (0), 0 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:34:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49450 states to 49450 states and 77949 transitions. [2024-10-11 03:34:11,436 INFO L78 Accepts]: Start accepts. Automaton has 49450 states and 77949 transitions. Word has length 92 [2024-10-11 03:34:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:11,437 INFO L471 AbstractCegarLoop]: Abstraction has 49450 states and 77949 transitions. [2024-10-11 03:34:11,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:34:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 49450 states and 77949 transitions. [2024-10-11 03:34:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:34:11,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:11,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:11,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:34:11,445 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:11,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:11,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1332792260, now seen corresponding path program 1 times [2024-10-11 03:34:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:11,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802252140] [2024-10-11 03:34:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:11,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:34:11,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:11,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802252140] [2024-10-11 03:34:11,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802252140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:11,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:11,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:11,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993364073] [2024-10-11 03:34:11,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:11,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:11,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:11,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:11,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:11,672 INFO L87 Difference]: Start difference. First operand 49450 states and 77949 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:34:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:12,022 INFO L93 Difference]: Finished difference Result 92379 states and 146098 transitions. [2024-10-11 03:34:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:34:12,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-11 03:34:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:12,104 INFO L225 Difference]: With dead ends: 92379 [2024-10-11 03:34:12,104 INFO L226 Difference]: Without dead ends: 43010 [2024-10-11 03:34:12,154 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:34:12,156 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 87 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:12,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 431 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states. [2024-10-11 03:34:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43004. [2024-10-11 03:34:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43004 states, 43003 states have (on average 1.5771690347185081) internal successors, (67823), 43003 states have internal predecessors, (67823), 0 states have call successors, (0), 0 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:34:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43004 states to 43004 states and 67823 transitions. [2024-10-11 03:34:12,976 INFO L78 Accepts]: Start accepts. Automaton has 43004 states and 67823 transitions. Word has length 93 [2024-10-11 03:34:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:12,976 INFO L471 AbstractCegarLoop]: Abstraction has 43004 states and 67823 transitions. [2024-10-11 03:34:12,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:34:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 43004 states and 67823 transitions. [2024-10-11 03:34:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:34:12,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:12,978 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:12,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:34:12,978 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:12,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash -336919691, now seen corresponding path program 1 times [2024-10-11 03:34:12,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:12,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970437906] [2024-10-11 03:34:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:34:13,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970437906] [2024-10-11 03:34:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970437906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:13,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:13,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:34:13,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878402201] [2024-10-11 03:34:13,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:13,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:34:13,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:34:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:34:13,269 INFO L87 Difference]: Start difference. First operand 43004 states and 67823 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:13,928 INFO L93 Difference]: Finished difference Result 101052 states and 160210 transitions. [2024-10-11 03:34:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:34:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:34:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:14,068 INFO L225 Difference]: With dead ends: 101052 [2024-10-11 03:34:14,069 INFO L226 Difference]: Without dead ends: 76470 [2024-10-11 03:34:14,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:34:14,082 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 387 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:14,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 565 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76470 states. [2024-10-11 03:34:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76470 to 66036. [2024-10-11 03:34:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66036 states, 66035 states have (on average 1.5795411524191716) internal successors, (104305), 66035 states have internal predecessors, (104305), 0 states have call successors, (0), 0 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:34:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66036 states to 66036 states and 104305 transitions. [2024-10-11 03:34:14,916 INFO L78 Accepts]: Start accepts. Automaton has 66036 states and 104305 transitions. Word has length 93 [2024-10-11 03:34:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:14,916 INFO L471 AbstractCegarLoop]: Abstraction has 66036 states and 104305 transitions. [2024-10-11 03:34:14,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 66036 states and 104305 transitions. [2024-10-11 03:34:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:34:14,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:14,918 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:14,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:34:14,918 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:14,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1876289132, now seen corresponding path program 1 times [2024-10-11 03:34:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:14,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700817841] [2024-10-11 03:34:14,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:14,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:34:15,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700817841] [2024-10-11 03:34:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700817841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:15,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968930631] [2024-10-11 03:34:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:15,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:15,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:15,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:15,005 INFO L87 Difference]: Start difference. First operand 66036 states and 104305 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:15,833 INFO L93 Difference]: Finished difference Result 156095 states and 246903 transitions. [2024-10-11 03:34:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:34:15,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:34:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:16,134 INFO L225 Difference]: With dead ends: 156095 [2024-10-11 03:34:16,134 INFO L226 Difference]: Without dead ends: 112119 [2024-10-11 03:34:16,162 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:34:16,163 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 96 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:16,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 365 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112119 states. [2024-10-11 03:34:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112119 to 111798. [2024-10-11 03:34:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111798 states, 111797 states have (on average 1.5774931348783956) internal successors, (176359), 111797 states have internal predecessors, (176359), 0 states have call successors, (0), 0 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:34:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111798 states to 111798 states and 176359 transitions. [2024-10-11 03:34:17,728 INFO L78 Accepts]: Start accepts. Automaton has 111798 states and 176359 transitions. Word has length 93 [2024-10-11 03:34:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:17,728 INFO L471 AbstractCegarLoop]: Abstraction has 111798 states and 176359 transitions. [2024-10-11 03:34:17,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 111798 states and 176359 transitions. [2024-10-11 03:34:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:34:17,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:17,731 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:17,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:34:17,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:17,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2036274214, now seen corresponding path program 1 times [2024-10-11 03:34:17,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:17,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526221318] [2024-10-11 03:34:17,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:17,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:34:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526221318] [2024-10-11 03:34:17,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526221318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:17,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:17,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:34:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623186486] [2024-10-11 03:34:17,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:17,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:34:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:34:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:34:17,854 INFO L87 Difference]: Start difference. First operand 111798 states and 176359 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:19,267 INFO L93 Difference]: Finished difference Result 203867 states and 322452 transitions. [2024-10-11 03:34:19,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:34:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:34:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:19,523 INFO L225 Difference]: With dead ends: 203867 [2024-10-11 03:34:19,523 INFO L226 Difference]: Without dead ends: 156131 [2024-10-11 03:34:19,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:34:19,575 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 222 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:19,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 619 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156131 states. [2024-10-11 03:34:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156131 to 149890. [2024-10-11 03:34:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149890 states, 149889 states have (on average 1.5744584325734376) internal successors, (235994), 149889 states have internal predecessors, (235994), 0 states have call successors, (0), 0 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:34:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149890 states to 149890 states and 235994 transitions. [2024-10-11 03:34:22,037 INFO L78 Accepts]: Start accepts. Automaton has 149890 states and 235994 transitions. Word has length 93 [2024-10-11 03:34:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:22,037 INFO L471 AbstractCegarLoop]: Abstraction has 149890 states and 235994 transitions. [2024-10-11 03:34:22,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 149890 states and 235994 transitions. [2024-10-11 03:34:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:34:22,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:22,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:22,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:34:22,039 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:22,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash 102983187, now seen corresponding path program 1 times [2024-10-11 03:34:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562640546] [2024-10-11 03:34:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:34:22,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:22,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562640546] [2024-10-11 03:34:22,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562640546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:22,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:22,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:34:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733559835] [2024-10-11 03:34:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:22,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:34:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:22,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:34:22,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:34:22,462 INFO L87 Difference]: Start difference. First operand 149890 states and 235994 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:24,326 INFO L93 Difference]: Finished difference Result 337004 states and 533817 transitions. [2024-10-11 03:34:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:34:24,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:34:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:24,846 INFO L225 Difference]: With dead ends: 337004 [2024-10-11 03:34:24,846 INFO L226 Difference]: Without dead ends: 259422 [2024-10-11 03:34:24,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:34:24,949 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 398 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:24,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 543 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259422 states. [2024-10-11 03:34:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259422 to 226238. [2024-10-11 03:34:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226238 states, 226237 states have (on average 1.5783359927863259) internal successors, (357078), 226237 states have internal predecessors, (357078), 0 states have call successors, (0), 0 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:34:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226238 states to 226238 states and 357078 transitions. [2024-10-11 03:34:29,251 INFO L78 Accepts]: Start accepts. Automaton has 226238 states and 357078 transitions. Word has length 93 [2024-10-11 03:34:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:29,251 INFO L471 AbstractCegarLoop]: Abstraction has 226238 states and 357078 transitions. [2024-10-11 03:34:29,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 226238 states and 357078 transitions. [2024-10-11 03:34:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:34:29,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:29,253 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:29,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:34:29,253 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:29,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1536256382, now seen corresponding path program 1 times [2024-10-11 03:34:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:29,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968969797] [2024-10-11 03:34:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:34:29,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:29,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968969797] [2024-10-11 03:34:29,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968969797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:29,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:29,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:29,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522197553] [2024-10-11 03:34:29,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:29,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:29,348 INFO L87 Difference]: Start difference. First operand 226238 states and 357078 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:34:32,220 INFO L93 Difference]: Finished difference Result 666615 states and 1051925 transitions. [2024-10-11 03:34:32,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:34:32,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:34:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:34:33,246 INFO L225 Difference]: With dead ends: 666615 [2024-10-11 03:34:33,247 INFO L226 Difference]: Without dead ends: 440460 [2024-10-11 03:34:33,473 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:34:33,474 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 153 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:34:33,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 488 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:34:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440460 states. [2024-10-11 03:34:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440460 to 440458. [2024-10-11 03:34:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440458 states, 440457 states have (on average 1.567024703887099) internal successors, (690207), 440457 states have internal predecessors, (690207), 0 states have call successors, (0), 0 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:34:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440458 states to 440458 states and 690207 transitions. [2024-10-11 03:34:41,768 INFO L78 Accepts]: Start accepts. Automaton has 440458 states and 690207 transitions. Word has length 94 [2024-10-11 03:34:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:34:41,768 INFO L471 AbstractCegarLoop]: Abstraction has 440458 states and 690207 transitions. [2024-10-11 03:34:41,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:34:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 440458 states and 690207 transitions. [2024-10-11 03:34:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:34:41,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:34:41,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:34:41,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:34:41,770 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:34:41,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:34:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash -627372532, now seen corresponding path program 1 times [2024-10-11 03:34:41,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:34:41,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78104264] [2024-10-11 03:34:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:34:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:34:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:34:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:34:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:34:41,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78104264] [2024-10-11 03:34:41,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78104264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:34:41,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:34:41,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:34:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624857312] [2024-10-11 03:34:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:34:41,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:34:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:34:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:34:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:34:41,850 INFO L87 Difference]: Start difference. First operand 440458 states and 690207 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)