./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 61bc671f3649b1d9d6fbe9f0597d430b8b23b87e2a7d2106b41de545f5b7b012 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:56:22,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:56:22,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:56:22,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:56:22,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:56:22,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:56:22,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:56:22,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:56:22,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:56:22,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:56:22,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:56:22,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:56:22,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:56:22,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:56:22,494 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:56:22,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:56:22,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:56:22,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:56:22,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:56:22,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:56:22,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:56:22,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:56:22,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:56:22,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:56:22,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:56:22,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:56:22,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:56:22,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:56:22,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:56:22,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:56:22,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:56:22,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:56:22,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:56:22,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:56:22,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:56:22,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:56:22,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:56:22,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:56:22,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:56:22,506 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 61bc671f3649b1d9d6fbe9f0597d430b8b23b87e2a7d2106b41de545f5b7b012 [2024-10-11 05:56:22,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:56:22,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:56:22,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:56:22,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:56:22,843 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:56:22,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2024-10-11 05:56:24,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:56:24,730 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:56:24,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2024-10-11 05:56:24,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b93c3af2b/d473579cb03141c9ad9ceb372ab17939/FLAGbd2b32a91 [2024-10-11 05:56:25,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b93c3af2b/d473579cb03141c9ad9ceb372ab17939 [2024-10-11 05:56:25,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:56:25,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:56:25,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:56:25,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:56:25,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:56:25,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:25,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0bea6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25, skipping insertion in model container [2024-10-11 05:56:25,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:25,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:56:25,355 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c[1280,1293] [2024-10-11 05:56:25,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:56:25,800 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:56:25,810 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c[1280,1293] [2024-10-11 05:56:25,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:56:25,972 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:56:25,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25 WrapperNode [2024-10-11 05:56:25,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:56:25,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:56:25,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:56:25,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:56:25,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,497 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3163 [2024-10-11 05:56:26,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:56:26,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:56:26,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:56:26,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:56:26,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,699 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 05:56:26,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:26,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:27,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:56:27,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:56:27,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:56:27,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:56:27,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (1/1) ... [2024-10-11 05:56:27,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:56:27,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:56:27,101 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 05:56:27,105 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 05:56:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:56:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 05:56:27,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 05:56:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:56:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:56:27,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:56:27,526 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:56:27,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:56:30,920 INFO L? ?]: Removed 1764 outVars from TransFormulas that were not future-live. [2024-10-11 05:56:30,920 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:56:31,037 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:56:31,039 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:56:31,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:31 BoogieIcfgContainer [2024-10-11 05:56:31,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:56:31,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:56:31,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:56:31,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:56:31,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:56:25" (1/3) ... [2024-10-11 05:56:31,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287c5027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:31, skipping insertion in model container [2024-10-11 05:56:31,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:25" (2/3) ... [2024-10-11 05:56:31,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287c5027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:31, skipping insertion in model container [2024-10-11 05:56:31,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:31" (3/3) ... [2024-10-11 05:56:31,050 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2024-10-11 05:56:31,070 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:56:31,071 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:56:31,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:56:31,172 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;@77fbb246, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:56:31,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:56:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 869 states, 863 states have (on average 1.4982618771726535) internal successors, (1293), 864 states have internal predecessors, (1293), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 05:56:31,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:31,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:31,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:31,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:31,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1759943001, now seen corresponding path program 1 times [2024-10-11 05:56:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909927252] [2024-10-11 05:56:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:31,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:31,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909927252] [2024-10-11 05:56:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909927252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 05:56:31,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140722785] [2024-10-11 05:56:31,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:31,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 05:56:31,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:32,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 05:56:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 05:56:32,016 INFO L87 Difference]: Start difference. First operand has 869 states, 863 states have (on average 1.4982618771726535) internal successors, (1293), 864 states have internal predecessors, (1293), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:56:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:32,124 INFO L93 Difference]: Finished difference Result 1572 states and 2354 transitions. [2024-10-11 05:56:32,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 05:56:32,128 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 212 [2024-10-11 05:56:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:32,145 INFO L225 Difference]: With dead ends: 1572 [2024-10-11 05:56:32,146 INFO L226 Difference]: Without dead ends: 868 [2024-10-11 05:56:32,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 05:56:32,155 INFO L432 NwaCegarLoop]: 1295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:32,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1295 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-11 05:56:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2024-10-11 05:56:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 863 states have (on average 1.4947856315179606) internal successors, (1290), 863 states have internal predecessors, (1290), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1296 transitions. [2024-10-11 05:56:32,260 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1296 transitions. Word has length 212 [2024-10-11 05:56:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:32,260 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1296 transitions. [2024-10-11 05:56:32,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:56:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1296 transitions. [2024-10-11 05:56:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 05:56:32,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:32,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:32,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:56:32,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:32,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash -799867423, now seen corresponding path program 1 times [2024-10-11 05:56:32,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:32,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567051596] [2024-10-11 05:56:32,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:32,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:33,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:33,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:33,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:33,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567051596] [2024-10-11 05:56:33,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567051596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:33,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760021546] [2024-10-11 05:56:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:33,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:33,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:33,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:33,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:33,849 INFO L87 Difference]: Start difference. First operand 868 states and 1296 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:33,905 INFO L93 Difference]: Finished difference Result 872 states and 1300 transitions. [2024-10-11 05:56:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:33,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 212 [2024-10-11 05:56:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:33,910 INFO L225 Difference]: With dead ends: 872 [2024-10-11 05:56:33,912 INFO L226 Difference]: Without dead ends: 870 [2024-10-11 05:56:33,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:33,917 INFO L432 NwaCegarLoop]: 1293 mSDtfsCounter, 0 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3874 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:33,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3874 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:33,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-10-11 05:56:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-10-11 05:56:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.4936416184971097) internal successors, (1292), 865 states have internal predecessors, (1292), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1298 transitions. [2024-10-11 05:56:33,950 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1298 transitions. Word has length 212 [2024-10-11 05:56:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:33,954 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1298 transitions. [2024-10-11 05:56:33,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1298 transitions. [2024-10-11 05:56:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 05:56:33,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:33,959 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:33,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:56:33,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:33,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash 975610057, now seen corresponding path program 1 times [2024-10-11 05:56:33,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:33,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956981719] [2024-10-11 05:56:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:34,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956981719] [2024-10-11 05:56:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956981719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:34,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652568237] [2024-10-11 05:56:34,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:34,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:34,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:34,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:34,765 INFO L87 Difference]: Start difference. First operand 870 states and 1298 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:35,519 INFO L93 Difference]: Finished difference Result 2170 states and 3240 transitions. [2024-10-11 05:56:35,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:35,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 213 [2024-10-11 05:56:35,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:35,525 INFO L225 Difference]: With dead ends: 2170 [2024-10-11 05:56:35,526 INFO L226 Difference]: Without dead ends: 870 [2024-10-11 05:56:35,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:56:35,530 INFO L432 NwaCegarLoop]: 1323 mSDtfsCounter, 2674 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:35,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 3674 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:56:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-10-11 05:56:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-10-11 05:56:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 865 states have (on average 1.492485549132948) internal successors, (1291), 865 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1297 transitions. [2024-10-11 05:56:35,553 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1297 transitions. Word has length 213 [2024-10-11 05:56:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:35,554 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1297 transitions. [2024-10-11 05:56:35,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1297 transitions. [2024-10-11 05:56:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 05:56:35,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:35,557 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:35,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:56:35,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:35,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:35,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1623046515, now seen corresponding path program 1 times [2024-10-11 05:56:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:35,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263646815] [2024-10-11 05:56:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:35,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:36,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:36,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:36,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:36,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:36,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263646815] [2024-10-11 05:56:36,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263646815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:36,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:36,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:36,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023919684] [2024-10-11 05:56:36,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:36,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:36,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:36,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:36,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:36,259 INFO L87 Difference]: Start difference. First operand 870 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:36,309 INFO L93 Difference]: Finished difference Result 1577 states and 2350 transitions. [2024-10-11 05:56:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 214 [2024-10-11 05:56:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:36,314 INFO L225 Difference]: With dead ends: 1577 [2024-10-11 05:56:36,314 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:36,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:36,317 INFO L432 NwaCegarLoop]: 1292 mSDtfsCounter, 0 mSDsluCounter, 2576 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3868 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:36,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3868 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.491349480968858) internal successors, (1293), 867 states have internal predecessors, (1293), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1299 transitions. [2024-10-11 05:56:36,370 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1299 transitions. Word has length 214 [2024-10-11 05:56:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:36,372 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1299 transitions. [2024-10-11 05:56:36,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1299 transitions. [2024-10-11 05:56:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 05:56:36,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:36,376 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:36,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:56:36,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:36,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:36,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1971837008, now seen corresponding path program 1 times [2024-10-11 05:56:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:36,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770484599] [2024-10-11 05:56:36,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:37,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:37,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770484599] [2024-10-11 05:56:37,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770484599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:37,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:37,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:37,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594098185] [2024-10-11 05:56:37,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:37,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:37,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:37,345 INFO L87 Difference]: Start difference. First operand 872 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:37,670 INFO L93 Difference]: Finished difference Result 1579 states and 2351 transitions. [2024-10-11 05:56:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:37,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 215 [2024-10-11 05:56:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:37,675 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:37,675 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:37,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 05:56:37,678 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 1108 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:37,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 2266 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4901960784313726) internal successors, (1292), 867 states have internal predecessors, (1292), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1298 transitions. [2024-10-11 05:56:37,698 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1298 transitions. Word has length 215 [2024-10-11 05:56:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:37,699 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1298 transitions. [2024-10-11 05:56:37,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1298 transitions. [2024-10-11 05:56:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 05:56:37,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:37,703 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:37,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:56:37,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:37,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2052466179, now seen corresponding path program 1 times [2024-10-11 05:56:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089721714] [2024-10-11 05:56:37,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:37,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:38,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:38,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089721714] [2024-10-11 05:56:38,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089721714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:38,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:38,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:38,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945496760] [2024-10-11 05:56:38,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:38,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:38,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:38,318 INFO L87 Difference]: Start difference. First operand 872 states and 1298 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:38,606 INFO L93 Difference]: Finished difference Result 1603 states and 2384 transitions. [2024-10-11 05:56:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:38,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 216 [2024-10-11 05:56:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:38,611 INFO L225 Difference]: With dead ends: 1603 [2024-10-11 05:56:38,611 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:38,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:38,614 INFO L432 NwaCegarLoop]: 1275 mSDtfsCounter, 1155 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:38,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 3687 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.489042675893887) internal successors, (1291), 867 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1297 transitions. [2024-10-11 05:56:38,641 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1297 transitions. Word has length 216 [2024-10-11 05:56:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:38,641 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1297 transitions. [2024-10-11 05:56:38,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1297 transitions. [2024-10-11 05:56:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 05:56:38,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:38,645 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:38,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:56:38,645 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:38,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1232784284, now seen corresponding path program 1 times [2024-10-11 05:56:38,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:38,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820059703] [2024-10-11 05:56:38,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:38,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:39,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:39,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:39,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820059703] [2024-10-11 05:56:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820059703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:39,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:39,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301252452] [2024-10-11 05:56:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:39,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:39,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:39,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:39,239 INFO L87 Difference]: Start difference. First operand 872 states and 1297 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:39,600 INFO L93 Difference]: Finished difference Result 1579 states and 2347 transitions. [2024-10-11 05:56:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 217 [2024-10-11 05:56:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:39,605 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:39,605 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:39,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:39,607 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 2407 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:39,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 2266 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:39,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4878892733564013) internal successors, (1290), 867 states have internal predecessors, (1290), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1296 transitions. [2024-10-11 05:56:39,629 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1296 transitions. Word has length 217 [2024-10-11 05:56:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:39,630 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1296 transitions. [2024-10-11 05:56:39,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1296 transitions. [2024-10-11 05:56:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 05:56:39,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:39,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:39,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:56:39,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:39,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash -622725180, now seen corresponding path program 1 times [2024-10-11 05:56:39,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:39,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047598395] [2024-10-11 05:56:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:40,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:40,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047598395] [2024-10-11 05:56:40,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047598395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:40,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:40,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:40,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473815520] [2024-10-11 05:56:40,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:40,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:40,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:40,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:40,219 INFO L87 Difference]: Start difference. First operand 872 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:40,557 INFO L93 Difference]: Finished difference Result 1579 states and 2345 transitions. [2024-10-11 05:56:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:40,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 218 [2024-10-11 05:56:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:40,562 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:40,562 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:40,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:40,564 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 2399 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2402 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:40,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2402 Valid, 2266 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4867358708189158) internal successors, (1289), 867 states have internal predecessors, (1289), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1295 transitions. [2024-10-11 05:56:40,588 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1295 transitions. Word has length 218 [2024-10-11 05:56:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:40,589 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1295 transitions. [2024-10-11 05:56:40,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1295 transitions. [2024-10-11 05:56:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 05:56:40,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:40,593 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:40,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:56:40,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:40,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1323927619, now seen corresponding path program 1 times [2024-10-11 05:56:40,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:40,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611882361] [2024-10-11 05:56:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:41,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:41,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611882361] [2024-10-11 05:56:41,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611882361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:41,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:41,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:41,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311048316] [2024-10-11 05:56:41,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:41,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:41,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:41,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:41,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:41,145 INFO L87 Difference]: Start difference. First operand 872 states and 1295 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:41,514 INFO L93 Difference]: Finished difference Result 1579 states and 2343 transitions. [2024-10-11 05:56:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:41,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 219 [2024-10-11 05:56:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:41,520 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:41,520 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:41,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:41,523 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 1274 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:41,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2272 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4855824682814303) internal successors, (1288), 867 states have internal predecessors, (1288), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1294 transitions. [2024-10-11 05:56:41,546 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1294 transitions. Word has length 219 [2024-10-11 05:56:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:41,546 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1294 transitions. [2024-10-11 05:56:41,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1294 transitions. [2024-10-11 05:56:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 05:56:41,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:41,550 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:41,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:56:41,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:41,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1396376309, now seen corresponding path program 1 times [2024-10-11 05:56:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:41,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854487973] [2024-10-11 05:56:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:42,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854487973] [2024-10-11 05:56:42,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854487973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:42,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:42,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949981781] [2024-10-11 05:56:42,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:42,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:42,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:42,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:42,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:42,066 INFO L87 Difference]: Start difference. First operand 872 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:42,411 INFO L93 Difference]: Finished difference Result 1579 states and 2341 transitions. [2024-10-11 05:56:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:42,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 220 [2024-10-11 05:56:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:42,416 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:42,416 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:42,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:42,420 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 2383 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2386 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:42,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2386 Valid, 2266 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4844290657439447) internal successors, (1287), 867 states have internal predecessors, (1287), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1293 transitions. [2024-10-11 05:56:42,443 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1293 transitions. Word has length 220 [2024-10-11 05:56:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:42,443 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1293 transitions. [2024-10-11 05:56:42,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1293 transitions. [2024-10-11 05:56:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 05:56:42,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:42,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:42,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:56:42,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:42,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1845148566, now seen corresponding path program 1 times [2024-10-11 05:56:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678854453] [2024-10-11 05:56:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:42,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:43,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:43,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:43,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:43,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:43,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678854453] [2024-10-11 05:56:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678854453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:43,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:43,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:43,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024130806] [2024-10-11 05:56:43,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:43,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:43,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:43,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:43,035 INFO L87 Difference]: Start difference. First operand 872 states and 1293 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:43,407 INFO L93 Difference]: Finished difference Result 1579 states and 2339 transitions. [2024-10-11 05:56:43,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:43,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 221 [2024-10-11 05:56:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:43,411 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:43,412 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:43,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:43,414 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 1266 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:43,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 2272 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.483275663206459) internal successors, (1286), 867 states have internal predecessors, (1286), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1292 transitions. [2024-10-11 05:56:43,438 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1292 transitions. Word has length 221 [2024-10-11 05:56:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:43,438 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1292 transitions. [2024-10-11 05:56:43,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1292 transitions. [2024-10-11 05:56:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 05:56:43,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:43,442 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:43,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:56:43,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:43,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:43,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1005038034, now seen corresponding path program 1 times [2024-10-11 05:56:43,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:43,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879130834] [2024-10-11 05:56:43,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:44,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879130834] [2024-10-11 05:56:44,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879130834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:44,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:44,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:44,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465357916] [2024-10-11 05:56:44,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:44,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:44,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:44,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:44,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:44,157 INFO L87 Difference]: Start difference. First operand 872 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:44,501 INFO L93 Difference]: Finished difference Result 1579 states and 2337 transitions. [2024-10-11 05:56:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:44,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 222 [2024-10-11 05:56:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:44,506 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:44,506 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:44,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:44,509 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 1262 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:44,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 2272 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4821222606689735) internal successors, (1285), 867 states have internal predecessors, (1285), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1291 transitions. [2024-10-11 05:56:44,535 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1291 transitions. Word has length 222 [2024-10-11 05:56:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:44,536 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1291 transitions. [2024-10-11 05:56:44,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1291 transitions. [2024-10-11 05:56:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 05:56:44,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:44,539 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:44,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:56:44,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:44,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1897611247, now seen corresponding path program 1 times [2024-10-11 05:56:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533158209] [2024-10-11 05:56:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533158209] [2024-10-11 05:56:45,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533158209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:45,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:45,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571647243] [2024-10-11 05:56:45,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:45,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:45,137 INFO L87 Difference]: Start difference. First operand 872 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:45,467 INFO L93 Difference]: Finished difference Result 1579 states and 2335 transitions. [2024-10-11 05:56:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 223 [2024-10-11 05:56:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:45,471 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:45,471 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:45,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:45,473 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 2359 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2362 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:45,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2362 Valid, 2266 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.480968858131488) internal successors, (1284), 867 states have internal predecessors, (1284), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1290 transitions. [2024-10-11 05:56:45,493 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1290 transitions. Word has length 223 [2024-10-11 05:56:45,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:45,493 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1290 transitions. [2024-10-11 05:56:45,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1290 transitions. [2024-10-11 05:56:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 05:56:45,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:45,496 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:45,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:56:45,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:45,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1476477415, now seen corresponding path program 1 times [2024-10-11 05:56:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352879578] [2024-10-11 05:56:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352879578] [2024-10-11 05:56:45,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352879578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:45,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:45,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585919602] [2024-10-11 05:56:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:45,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:45,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:45,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:45,995 INFO L87 Difference]: Start difference. First operand 872 states and 1290 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:46,311 INFO L93 Difference]: Finished difference Result 1579 states and 2333 transitions. [2024-10-11 05:56:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:46,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 224 [2024-10-11 05:56:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:46,316 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:46,316 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:46,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:46,319 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 1254 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:46,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2272 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4798154555940024) internal successors, (1283), 867 states have internal predecessors, (1283), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1289 transitions. [2024-10-11 05:56:46,339 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1289 transitions. Word has length 224 [2024-10-11 05:56:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:46,340 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1289 transitions. [2024-10-11 05:56:46,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1289 transitions. [2024-10-11 05:56:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 05:56:46,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:46,343 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:46,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:56:46,343 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:46,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash -599868616, now seen corresponding path program 1 times [2024-10-11 05:56:46,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:46,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58390628] [2024-10-11 05:56:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58390628] [2024-10-11 05:56:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58390628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:46,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:46,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422956026] [2024-10-11 05:56:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:46,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:46,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:46,814 INFO L87 Difference]: Start difference. First operand 872 states and 1289 transitions. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:47,129 INFO L93 Difference]: Finished difference Result 1579 states and 2331 transitions. [2024-10-11 05:56:47,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:47,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 225 [2024-10-11 05:56:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:47,133 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:47,133 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:47,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:47,136 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 2343 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2346 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:47,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2346 Valid, 2266 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4786620530565167) internal successors, (1282), 867 states have internal predecessors, (1282), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1288 transitions. [2024-10-11 05:56:47,154 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1288 transitions. Word has length 225 [2024-10-11 05:56:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:47,155 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1288 transitions. [2024-10-11 05:56:47,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1288 transitions. [2024-10-11 05:56:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-11 05:56:47,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:47,158 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:47,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:56:47,159 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:47,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash -807470624, now seen corresponding path program 1 times [2024-10-11 05:56:47,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:47,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077717181] [2024-10-11 05:56:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:47,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:47,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:47,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077717181] [2024-10-11 05:56:47,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077717181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:47,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:47,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:47,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435343378] [2024-10-11 05:56:47,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:47,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:47,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:47,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:47,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:47,641 INFO L87 Difference]: Start difference. First operand 872 states and 1288 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:47,954 INFO L93 Difference]: Finished difference Result 1579 states and 2329 transitions. [2024-10-11 05:56:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:47,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 226 [2024-10-11 05:56:47,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:47,958 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:47,958 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:47,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:47,960 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 2335 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2338 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:47,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2338 Valid, 2266 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4775086505190311) internal successors, (1281), 867 states have internal predecessors, (1281), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1287 transitions. [2024-10-11 05:56:47,981 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1287 transitions. Word has length 226 [2024-10-11 05:56:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:47,982 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1287 transitions. [2024-10-11 05:56:47,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1287 transitions. [2024-10-11 05:56:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-11 05:56:47,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:47,985 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:47,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:56:47,985 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:47,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash 728364511, now seen corresponding path program 1 times [2024-10-11 05:56:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:47,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556434890] [2024-10-11 05:56:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:48,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556434890] [2024-10-11 05:56:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556434890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:48,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:48,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:48,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595438627] [2024-10-11 05:56:48,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:48,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:48,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:48,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:48,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:48,455 INFO L87 Difference]: Start difference. First operand 872 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:48,757 INFO L93 Difference]: Finished difference Result 1579 states and 2327 transitions. [2024-10-11 05:56:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:48,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 227 [2024-10-11 05:56:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:48,762 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:48,762 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:48,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:48,764 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 1242 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:48,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2272 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4763552479815456) internal successors, (1280), 867 states have internal predecessors, (1280), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1286 transitions. [2024-10-11 05:56:48,787 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1286 transitions. Word has length 227 [2024-10-11 05:56:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:48,788 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1286 transitions. [2024-10-11 05:56:48,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1286 transitions. [2024-10-11 05:56:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 05:56:48,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:48,790 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:48,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:56:48,791 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash 830283047, now seen corresponding path program 1 times [2024-10-11 05:56:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:48,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005518892] [2024-10-11 05:56:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:49,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005518892] [2024-10-11 05:56:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005518892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:49,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:49,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:49,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816919666] [2024-10-11 05:56:49,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:49,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:49,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:49,325 INFO L87 Difference]: Start difference. First operand 872 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:49,702 INFO L93 Difference]: Finished difference Result 1579 states and 2325 transitions. [2024-10-11 05:56:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:49,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 228 [2024-10-11 05:56:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:49,706 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:49,706 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:49,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:49,708 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 1235 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:49,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 2272 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:49,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.47520184544406) internal successors, (1279), 867 states have internal predecessors, (1279), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1285 transitions. [2024-10-11 05:56:49,725 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1285 transitions. Word has length 228 [2024-10-11 05:56:49,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:49,725 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1285 transitions. [2024-10-11 05:56:49,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1285 transitions. [2024-10-11 05:56:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 05:56:49,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:49,728 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:49,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:56:49,728 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:49,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1870542785, now seen corresponding path program 1 times [2024-10-11 05:56:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:49,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282397209] [2024-10-11 05:56:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:50,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:50,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282397209] [2024-10-11 05:56:50,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282397209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:50,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:50,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397857400] [2024-10-11 05:56:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:50,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:50,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:50,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:50,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:50,198 INFO L87 Difference]: Start difference. First operand 872 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:50,486 INFO L93 Difference]: Finished difference Result 1579 states and 2323 transitions. [2024-10-11 05:56:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 229 [2024-10-11 05:56:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:50,491 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:50,491 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:50,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:50,493 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 2305 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2308 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:50,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2308 Valid, 2266 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4740484429065743) internal successors, (1278), 867 states have internal predecessors, (1278), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1284 transitions. [2024-10-11 05:56:50,510 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1284 transitions. Word has length 229 [2024-10-11 05:56:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:50,511 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1284 transitions. [2024-10-11 05:56:50,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1284 transitions. [2024-10-11 05:56:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 05:56:50,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:50,513 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:56:50,513 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:50,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1220661920, now seen corresponding path program 1 times [2024-10-11 05:56:50,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:50,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531574784] [2024-10-11 05:56:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:50,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531574784] [2024-10-11 05:56:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531574784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:50,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:50,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:50,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922565578] [2024-10-11 05:56:50,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:50,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:50,987 INFO L87 Difference]: Start difference. First operand 872 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:51,275 INFO L93 Difference]: Finished difference Result 1579 states and 2321 transitions. [2024-10-11 05:56:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:51,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 230 [2024-10-11 05:56:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:51,280 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:51,280 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:51,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:51,282 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 2297 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2300 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:51,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2300 Valid, 2266 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4728950403690888) internal successors, (1277), 867 states have internal predecessors, (1277), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1283 transitions. [2024-10-11 05:56:51,311 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1283 transitions. Word has length 230 [2024-10-11 05:56:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:51,312 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1283 transitions. [2024-10-11 05:56:51,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1283 transitions. [2024-10-11 05:56:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 05:56:51,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:51,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:51,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:56:51,315 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:51,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1985564392, now seen corresponding path program 1 times [2024-10-11 05:56:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:51,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082972718] [2024-10-11 05:56:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:52,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:52,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082972718] [2024-10-11 05:56:52,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082972718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:52,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:52,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:52,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077753645] [2024-10-11 05:56:52,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:52,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:52,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:52,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:52,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:52,109 INFO L87 Difference]: Start difference. First operand 872 states and 1283 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:52,288 INFO L93 Difference]: Finished difference Result 1579 states and 2319 transitions. [2024-10-11 05:56:52,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:52,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 231 [2024-10-11 05:56:52,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:52,292 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:52,292 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:52,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 05:56:52,295 INFO L432 NwaCegarLoop]: 1196 mSDtfsCounter, 1120 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:52,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 2394 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4717416378316033) internal successors, (1276), 867 states have internal predecessors, (1276), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1282 transitions. [2024-10-11 05:56:52,318 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1282 transitions. Word has length 231 [2024-10-11 05:56:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:52,320 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1282 transitions. [2024-10-11 05:56:52,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1282 transitions. [2024-10-11 05:56:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 05:56:52,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:52,324 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:52,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:56:52,324 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:52,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:52,324 INFO L85 PathProgramCache]: Analyzing trace with hash -748010009, now seen corresponding path program 1 times [2024-10-11 05:56:52,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:52,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070308945] [2024-10-11 05:56:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:52,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:52,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:52,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070308945] [2024-10-11 05:56:52,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070308945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:52,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:52,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:52,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785222026] [2024-10-11 05:56:52,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:52,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:52,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:52,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:52,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:52,755 INFO L87 Difference]: Start difference. First operand 872 states and 1282 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:52,914 INFO L93 Difference]: Finished difference Result 1591 states and 2334 transitions. [2024-10-11 05:56:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:52,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 232 [2024-10-11 05:56:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:52,918 INFO L225 Difference]: With dead ends: 1591 [2024-10-11 05:56:52,918 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:52,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:52,919 INFO L432 NwaCegarLoop]: 1265 mSDtfsCounter, 1143 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 3731 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:52,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 3731 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4705882352941178) internal successors, (1275), 867 states have internal predecessors, (1275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1281 transitions. [2024-10-11 05:56:52,934 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1281 transitions. Word has length 232 [2024-10-11 05:56:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:52,935 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1281 transitions. [2024-10-11 05:56:52,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1281 transitions. [2024-10-11 05:56:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 05:56:52,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:52,937 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:52,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:56:52,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:52,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1907578546, now seen corresponding path program 1 times [2024-10-11 05:56:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121810220] [2024-10-11 05:56:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121810220] [2024-10-11 05:56:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121810220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:53,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:53,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835102176] [2024-10-11 05:56:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:53,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:53,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:53,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:53,441 INFO L87 Difference]: Start difference. First operand 872 states and 1281 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:53,625 INFO L93 Difference]: Finished difference Result 1579 states and 2315 transitions. [2024-10-11 05:56:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:53,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 233 [2024-10-11 05:56:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:53,630 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:53,630 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:53,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:53,632 INFO L432 NwaCegarLoop]: 1196 mSDtfsCounter, 2391 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:53,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 2394 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.469434832756632) internal successors, (1274), 867 states have internal predecessors, (1274), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1280 transitions. [2024-10-11 05:56:53,648 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1280 transitions. Word has length 233 [2024-10-11 05:56:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:53,649 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1280 transitions. [2024-10-11 05:56:53,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1280 transitions. [2024-10-11 05:56:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 05:56:53,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:53,651 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:53,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:56:53,651 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:53,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1318535342, now seen corresponding path program 1 times [2024-10-11 05:56:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490757434] [2024-10-11 05:56:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:53,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490757434] [2024-10-11 05:56:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490757434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:54,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:54,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367219166] [2024-10-11 05:56:54,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:54,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:54,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:54,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:54,109 INFO L87 Difference]: Start difference. First operand 872 states and 1280 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:54,283 INFO L93 Difference]: Finished difference Result 1579 states and 2313 transitions. [2024-10-11 05:56:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:54,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 234 [2024-10-11 05:56:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:54,287 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:54,287 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:54,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:54,288 INFO L432 NwaCegarLoop]: 1196 mSDtfsCounter, 2383 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2386 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:54,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2386 Valid, 2394 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4682814302191465) internal successors, (1273), 867 states have internal predecessors, (1273), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1279 transitions. [2024-10-11 05:56:54,303 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1279 transitions. Word has length 234 [2024-10-11 05:56:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:54,304 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1279 transitions. [2024-10-11 05:56:54,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1279 transitions. [2024-10-11 05:56:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-11 05:56:54,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:54,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:54,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:56:54,306 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:54,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2101899509, now seen corresponding path program 1 times [2024-10-11 05:56:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398038913] [2024-10-11 05:56:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398038913] [2024-10-11 05:56:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398038913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:54,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102718802] [2024-10-11 05:56:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:54,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:54,746 INFO L87 Difference]: Start difference. First operand 872 states and 1279 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:54,923 INFO L93 Difference]: Finished difference Result 1579 states and 2311 transitions. [2024-10-11 05:56:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:54,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 235 [2024-10-11 05:56:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:54,927 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:54,927 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:54,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:54,929 INFO L432 NwaCegarLoop]: 1196 mSDtfsCounter, 1258 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:54,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 2400 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.467128027681661) internal successors, (1272), 867 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1278 transitions. [2024-10-11 05:56:54,951 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1278 transitions. Word has length 235 [2024-10-11 05:56:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:54,952 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1278 transitions. [2024-10-11 05:56:54,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1278 transitions. [2024-10-11 05:56:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 05:56:54,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:54,954 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:54,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:56:54,954 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:54,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash -832118027, now seen corresponding path program 1 times [2024-10-11 05:56:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:54,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071316087] [2024-10-11 05:56:54,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:55,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:55,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:55,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:55,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071316087] [2024-10-11 05:56:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071316087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:55,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:55,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759893447] [2024-10-11 05:56:55,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:55,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:55,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:55,487 INFO L87 Difference]: Start difference. First operand 872 states and 1278 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:55,738 INFO L93 Difference]: Finished difference Result 1579 states and 2309 transitions. [2024-10-11 05:56:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 236 [2024-10-11 05:56:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:55,742 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:55,742 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:55,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:55,744 INFO L432 NwaCegarLoop]: 1196 mSDtfsCounter, 1254 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:55,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2400 Invalid, 156 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4659746251441754) internal successors, (1271), 867 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1277 transitions. [2024-10-11 05:56:55,763 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1277 transitions. Word has length 236 [2024-10-11 05:56:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:55,763 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1277 transitions. [2024-10-11 05:56:55,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1277 transitions. [2024-10-11 05:56:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-11 05:56:55,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:55,765 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:55,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:56:55,766 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:55,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash -548046820, now seen corresponding path program 1 times [2024-10-11 05:56:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470162552] [2024-10-11 05:56:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:56,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:56,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:56,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470162552] [2024-10-11 05:56:56,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470162552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:56,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:56,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:56,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550755708] [2024-10-11 05:56:56,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:56,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:56,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:56,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:56,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:56,257 INFO L87 Difference]: Start difference. First operand 872 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:56,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:56,433 INFO L93 Difference]: Finished difference Result 1579 states and 2307 transitions. [2024-10-11 05:56:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:56,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 237 [2024-10-11 05:56:56,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:56,437 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:56,437 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:56,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:56,439 INFO L432 NwaCegarLoop]: 1196 mSDtfsCounter, 2359 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2362 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:56,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2362 Valid, 2394 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4648212226066897) internal successors, (1270), 867 states have internal predecessors, (1270), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1276 transitions. [2024-10-11 05:56:56,460 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1276 transitions. Word has length 237 [2024-10-11 05:56:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:56,460 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1276 transitions. [2024-10-11 05:56:56,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1276 transitions. [2024-10-11 05:56:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 05:56:56,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:56,462 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:56,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:56:56,463 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:56,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1979847492, now seen corresponding path program 1 times [2024-10-11 05:56:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647047375] [2024-10-11 05:56:56,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:56,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:56,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:56,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:56,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647047375] [2024-10-11 05:56:56,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647047375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:56,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:56,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:56,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556359946] [2024-10-11 05:56:56,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:56,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:56,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:56,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:56,939 INFO L87 Difference]: Start difference. First operand 872 states and 1276 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:57,113 INFO L93 Difference]: Finished difference Result 1579 states and 2305 transitions. [2024-10-11 05:56:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:57,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 238 [2024-10-11 05:56:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:57,122 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:57,122 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:57,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:57,124 INFO L432 NwaCegarLoop]: 1196 mSDtfsCounter, 2345 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:57,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 2394 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4636678200692042) internal successors, (1269), 867 states have internal predecessors, (1269), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1275 transitions. [2024-10-11 05:56:57,141 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1275 transitions. Word has length 238 [2024-10-11 05:56:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:57,141 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1275 transitions. [2024-10-11 05:56:57,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1275 transitions. [2024-10-11 05:56:57,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 05:56:57,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:57,143 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:57,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:56:57,144 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:57,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1634100604, now seen corresponding path program 1 times [2024-10-11 05:56:57,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:57,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592534713] [2024-10-11 05:56:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:57,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:57,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:57,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592534713] [2024-10-11 05:56:57,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592534713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:57,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:57,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:57,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001352517] [2024-10-11 05:56:57,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:57,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:57,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:57,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:57,808 INFO L87 Difference]: Start difference. First operand 872 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:57,884 INFO L93 Difference]: Finished difference Result 1579 states and 2303 transitions. [2024-10-11 05:56:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:57,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 239 [2024-10-11 05:56:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:57,888 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:57,888 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:57,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 05:56:57,894 INFO L432 NwaCegarLoop]: 1248 mSDtfsCounter, 1134 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:57,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 2498 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4625144175317186) internal successors, (1268), 867 states have internal predecessors, (1268), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1274 transitions. [2024-10-11 05:56:57,913 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1274 transitions. Word has length 239 [2024-10-11 05:56:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:57,913 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1274 transitions. [2024-10-11 05:56:57,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1274 transitions. [2024-10-11 05:56:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 05:56:57,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:57,916 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:57,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 05:56:57,916 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:57,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1702123736, now seen corresponding path program 1 times [2024-10-11 05:56:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697602492] [2024-10-11 05:56:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:58,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:58,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697602492] [2024-10-11 05:56:58,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697602492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:58,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:58,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:58,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870406363] [2024-10-11 05:56:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:58,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:58,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:58,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:58,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:58,386 INFO L87 Difference]: Start difference. First operand 872 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:58,457 INFO L93 Difference]: Finished difference Result 1581 states and 2303 transitions. [2024-10-11 05:56:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:58,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 240 [2024-10-11 05:56:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:58,464 INFO L225 Difference]: With dead ends: 1581 [2024-10-11 05:56:58,464 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:58,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:58,466 INFO L432 NwaCegarLoop]: 1262 mSDtfsCounter, 1137 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 3777 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:58,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 3777 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4613610149942329) internal successors, (1267), 867 states have internal predecessors, (1267), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1273 transitions. [2024-10-11 05:56:58,482 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1273 transitions. Word has length 240 [2024-10-11 05:56:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:58,483 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1273 transitions. [2024-10-11 05:56:58,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1273 transitions. [2024-10-11 05:56:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 05:56:58,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:58,484 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:58,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 05:56:58,485 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:58,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1460092053, now seen corresponding path program 1 times [2024-10-11 05:56:58,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:58,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181642140] [2024-10-11 05:56:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:59,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:59,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181642140] [2024-10-11 05:56:59,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181642140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:59,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827159145] [2024-10-11 05:56:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:59,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:59,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:59,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:59,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:59,045 INFO L87 Difference]: Start difference. First operand 872 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:59,152 INFO L93 Difference]: Finished difference Result 1579 states and 2299 transitions. [2024-10-11 05:56:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:59,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 241 [2024-10-11 05:56:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:59,155 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:59,155 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:59,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 05:56:59,156 INFO L432 NwaCegarLoop]: 1226 mSDtfsCounter, 1128 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:59,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 2454 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4602076124567474) internal successors, (1266), 867 states have internal predecessors, (1266), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1272 transitions. [2024-10-11 05:56:59,172 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1272 transitions. Word has length 241 [2024-10-11 05:56:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:59,172 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1272 transitions. [2024-10-11 05:56:59,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1272 transitions. [2024-10-11 05:56:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 05:56:59,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:59,174 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:59,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 05:56:59,175 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:59,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1513914840, now seen corresponding path program 1 times [2024-10-11 05:56:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790481965] [2024-10-11 05:56:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:59,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:56:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:56:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:59,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790481965] [2024-10-11 05:56:59,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790481965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:59,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:59,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707562234] [2024-10-11 05:56:59,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:59,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:59,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:59,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:59,728 INFO L87 Difference]: Start difference. First operand 872 states and 1272 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:59,857 INFO L93 Difference]: Finished difference Result 1579 states and 2297 transitions. [2024-10-11 05:56:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:59,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 242 [2024-10-11 05:56:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:59,860 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:56:59,860 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:56:59,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:59,862 INFO L432 NwaCegarLoop]: 1226 mSDtfsCounter, 1257 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:59,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 2460 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:56:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:56:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4590542099192618) internal successors, (1265), 867 states have internal predecessors, (1265), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1271 transitions. [2024-10-11 05:56:59,886 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1271 transitions. Word has length 242 [2024-10-11 05:56:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:59,887 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1271 transitions. [2024-10-11 05:56:59,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1271 transitions. [2024-10-11 05:56:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-11 05:56:59,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:59,889 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:59,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 05:56:59,890 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:59,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:59,890 INFO L85 PathProgramCache]: Analyzing trace with hash -459084754, now seen corresponding path program 1 times [2024-10-11 05:56:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:59,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767667033] [2024-10-11 05:56:59,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:57:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:57:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:00,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:00,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767667033] [2024-10-11 05:57:00,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767667033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:00,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838683748] [2024-10-11 05:57:00,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:00,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:00,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:00,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:00,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:00,353 INFO L87 Difference]: Start difference. First operand 872 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:00,462 INFO L93 Difference]: Finished difference Result 1579 states and 2295 transitions. [2024-10-11 05:57:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:00,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 243 [2024-10-11 05:57:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:00,465 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:00,466 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:00,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:00,467 INFO L432 NwaCegarLoop]: 1226 mSDtfsCounter, 2371 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:00,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 2454 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4579008073817763) internal successors, (1264), 867 states have internal predecessors, (1264), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1270 transitions. [2024-10-11 05:57:00,483 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1270 transitions. Word has length 243 [2024-10-11 05:57:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:00,484 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1270 transitions. [2024-10-11 05:57:00,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1270 transitions. [2024-10-11 05:57:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-11 05:57:00,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:00,486 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 05:57:00,486 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:00,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1420341743, now seen corresponding path program 1 times [2024-10-11 05:57:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302886296] [2024-10-11 05:57:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:57:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:57:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:00,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302886296] [2024-10-11 05:57:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302886296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:00,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:00,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840590678] [2024-10-11 05:57:00,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:00,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:00,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:00,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:00,933 INFO L87 Difference]: Start difference. First operand 872 states and 1270 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:01,043 INFO L93 Difference]: Finished difference Result 1579 states and 2293 transitions. [2024-10-11 05:57:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2024-10-11 05:57:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:01,045 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:01,045 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:01,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:01,046 INFO L432 NwaCegarLoop]: 1226 mSDtfsCounter, 2363 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2366 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:01,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2366 Valid, 2454 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4567474048442905) internal successors, (1263), 867 states have internal predecessors, (1263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1269 transitions. [2024-10-11 05:57:01,064 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1269 transitions. Word has length 244 [2024-10-11 05:57:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:01,065 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1269 transitions. [2024-10-11 05:57:01,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1269 transitions. [2024-10-11 05:57:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 05:57:01,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:01,067 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:01,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 05:57:01,067 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:01,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1504752711, now seen corresponding path program 1 times [2024-10-11 05:57:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:01,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221889698] [2024-10-11 05:57:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:01,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:57:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 05:57:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:01,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221889698] [2024-10-11 05:57:01,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221889698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:01,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:01,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:57:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780368555] [2024-10-11 05:57:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:01,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:57:01,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:01,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:57:01,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:57:01,722 INFO L87 Difference]: Start difference. First operand 872 states and 1269 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:57:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:01,785 INFO L93 Difference]: Finished difference Result 1579 states and 2291 transitions. [2024-10-11 05:57:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:01,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 245 [2024-10-11 05:57:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:01,787 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:01,787 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:01,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 05:57:01,789 INFO L432 NwaCegarLoop]: 1248 mSDtfsCounter, 1167 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:01,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 2498 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:57:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.455594002306805) internal successors, (1262), 867 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1268 transitions. [2024-10-11 05:57:01,808 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1268 transitions. Word has length 245 [2024-10-11 05:57:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:01,808 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1268 transitions. [2024-10-11 05:57:01,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:57:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1268 transitions. [2024-10-11 05:57:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 05:57:01,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:01,810 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:01,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 05:57:01,811 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:01,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1794068361, now seen corresponding path program 1 times [2024-10-11 05:57:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809194854] [2024-10-11 05:57:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 05:57:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:57:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:02,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809194854] [2024-10-11 05:57:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809194854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:02,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:57:02,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51930022] [2024-10-11 05:57:02,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:57:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:02,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:57:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:57:02,471 INFO L87 Difference]: Start difference. First operand 872 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:57:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:02,536 INFO L93 Difference]: Finished difference Result 1579 states and 2289 transitions. [2024-10-11 05:57:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:02,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 246 [2024-10-11 05:57:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:02,538 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:02,538 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:02,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 05:57:02,540 INFO L432 NwaCegarLoop]: 1248 mSDtfsCounter, 1165 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:02,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 2498 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:57:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4544405997693195) internal successors, (1261), 867 states have internal predecessors, (1261), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1267 transitions. [2024-10-11 05:57:02,557 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1267 transitions. Word has length 246 [2024-10-11 05:57:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:02,557 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1267 transitions. [2024-10-11 05:57:02,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:57:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1267 transitions. [2024-10-11 05:57:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 05:57:02,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:02,559 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:02,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 05:57:02,560 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:02,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash -399512886, now seen corresponding path program 1 times [2024-10-11 05:57:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261043534] [2024-10-11 05:57:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:03,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:03,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261043534] [2024-10-11 05:57:03,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261043534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:03,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:03,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453178938] [2024-10-11 05:57:03,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:03,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:03,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:03,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:03,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:03,566 INFO L87 Difference]: Start difference. First operand 872 states and 1267 transitions. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:03,681 INFO L93 Difference]: Finished difference Result 1579 states and 2287 transitions. [2024-10-11 05:57:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:03,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 247 [2024-10-11 05:57:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:03,683 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:03,684 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:03,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:03,687 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 1121 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:03,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 2450 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.453287197231834) internal successors, (1260), 867 states have internal predecessors, (1260), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1266 transitions. [2024-10-11 05:57:03,708 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1266 transitions. Word has length 247 [2024-10-11 05:57:03,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:03,708 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1266 transitions. [2024-10-11 05:57:03,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1266 transitions. [2024-10-11 05:57:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 05:57:03,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:03,710 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:03,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 05:57:03,710 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:03,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1151728298, now seen corresponding path program 1 times [2024-10-11 05:57:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:03,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53653706] [2024-10-11 05:57:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:04,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53653706] [2024-10-11 05:57:04,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53653706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:04,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:04,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549181446] [2024-10-11 05:57:04,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:04,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:04,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:04,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:04,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:04,606 INFO L87 Difference]: Start difference. First operand 872 states and 1266 transitions. Second operand has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:04,734 INFO L93 Difference]: Finished difference Result 1579 states and 2285 transitions. [2024-10-11 05:57:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:04,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 248 [2024-10-11 05:57:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:04,737 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:04,737 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:04,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:04,739 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 2230 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2230 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:04,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2230 Valid, 2450 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4521337946943482) internal successors, (1259), 867 states have internal predecessors, (1259), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1265 transitions. [2024-10-11 05:57:04,755 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1265 transitions. Word has length 248 [2024-10-11 05:57:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:04,755 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1265 transitions. [2024-10-11 05:57:04,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1265 transitions. [2024-10-11 05:57:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 05:57:04,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:04,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:04,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 05:57:04,758 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:04,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1895279029, now seen corresponding path program 1 times [2024-10-11 05:57:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:04,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047918474] [2024-10-11 05:57:04,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:04,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:05,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:05,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047918474] [2024-10-11 05:57:05,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047918474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:05,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247627964] [2024-10-11 05:57:05,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:05,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:05,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:05,499 INFO L87 Difference]: Start difference. First operand 872 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:05,609 INFO L93 Difference]: Finished difference Result 1579 states and 2283 transitions. [2024-10-11 05:57:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:05,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 249 [2024-10-11 05:57:05,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:05,611 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:05,612 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:05,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:05,613 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 2224 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:05,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2224 Valid, 2450 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4509803921568627) internal successors, (1258), 867 states have internal predecessors, (1258), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1264 transitions. [2024-10-11 05:57:05,631 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1264 transitions. Word has length 249 [2024-10-11 05:57:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:05,631 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1264 transitions. [2024-10-11 05:57:05,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1264 transitions. [2024-10-11 05:57:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-11 05:57:05,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:05,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:05,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 05:57:05,634 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1971853033, now seen corresponding path program 1 times [2024-10-11 05:57:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054831759] [2024-10-11 05:57:05,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:05,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054831759] [2024-10-11 05:57:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054831759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:06,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:06,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:06,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368029766] [2024-10-11 05:57:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:06,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:06,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:06,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:06,330 INFO L87 Difference]: Start difference. First operand 872 states and 1264 transitions. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:06,488 INFO L93 Difference]: Finished difference Result 1579 states and 2281 transitions. [2024-10-11 05:57:06,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:06,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 250 [2024-10-11 05:57:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:06,491 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:06,491 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:06,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:06,492 INFO L432 NwaCegarLoop]: 1185 mSDtfsCounter, 1103 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:06,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 2372 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4498269896193772) internal successors, (1257), 867 states have internal predecessors, (1257), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1263 transitions. [2024-10-11 05:57:06,508 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1263 transitions. Word has length 250 [2024-10-11 05:57:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:06,508 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1263 transitions. [2024-10-11 05:57:06,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1263 transitions. [2024-10-11 05:57:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 05:57:06,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:06,510 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:06,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 05:57:06,511 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:06,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1254078891, now seen corresponding path program 1 times [2024-10-11 05:57:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:06,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228604571] [2024-10-11 05:57:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:06,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:07,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228604571] [2024-10-11 05:57:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228604571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:07,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513377137] [2024-10-11 05:57:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:07,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:07,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:07,243 INFO L87 Difference]: Start difference. First operand 872 states and 1263 transitions. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:07,424 INFO L93 Difference]: Finished difference Result 1579 states and 2279 transitions. [2024-10-11 05:57:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 251 [2024-10-11 05:57:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:07,427 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:07,427 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:07,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:07,429 INFO L432 NwaCegarLoop]: 1185 mSDtfsCounter, 2194 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:07,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2194 Valid, 2372 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4486735870818916) internal successors, (1256), 867 states have internal predecessors, (1256), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1262 transitions. [2024-10-11 05:57:07,445 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1262 transitions. Word has length 251 [2024-10-11 05:57:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:07,446 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1262 transitions. [2024-10-11 05:57:07,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1262 transitions. [2024-10-11 05:57:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-11 05:57:07,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:07,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:07,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 05:57:07,448 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:07,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1054517206, now seen corresponding path program 1 times [2024-10-11 05:57:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:07,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514760075] [2024-10-11 05:57:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514760075] [2024-10-11 05:57:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514760075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059558522] [2024-10-11 05:57:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:08,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:08,124 INFO L87 Difference]: Start difference. First operand 872 states and 1262 transitions. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:08,306 INFO L93 Difference]: Finished difference Result 1579 states and 2277 transitions. [2024-10-11 05:57:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:08,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 252 [2024-10-11 05:57:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:08,308 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:08,308 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:08,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:08,309 INFO L432 NwaCegarLoop]: 1185 mSDtfsCounter, 1098 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:08,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 2378 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.447520184544406) internal successors, (1255), 867 states have internal predecessors, (1255), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1261 transitions. [2024-10-11 05:57:08,326 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1261 transitions. Word has length 252 [2024-10-11 05:57:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:08,326 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1261 transitions. [2024-10-11 05:57:08,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1261 transitions. [2024-10-11 05:57:08,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-11 05:57:08,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:08,328 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:08,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 05:57:08,329 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:08,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:08,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1247401942, now seen corresponding path program 1 times [2024-10-11 05:57:08,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:08,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712211909] [2024-10-11 05:57:08,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:08,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712211909] [2024-10-11 05:57:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712211909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:09,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:09,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130220925] [2024-10-11 05:57:09,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:09,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:09,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:09,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:09,006 INFO L87 Difference]: Start difference. First operand 872 states and 1261 transitions. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:09,199 INFO L93 Difference]: Finished difference Result 1579 states and 2275 transitions. [2024-10-11 05:57:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:09,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 253 [2024-10-11 05:57:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:09,201 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:09,201 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:09,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:09,205 INFO L432 NwaCegarLoop]: 1185 mSDtfsCounter, 2182 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:09,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 2372 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4463667820069204) internal successors, (1254), 867 states have internal predecessors, (1254), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1260 transitions. [2024-10-11 05:57:09,225 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1260 transitions. Word has length 253 [2024-10-11 05:57:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:09,226 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1260 transitions. [2024-10-11 05:57:09,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1260 transitions. [2024-10-11 05:57:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-11 05:57:09,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:09,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:09,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 05:57:09,229 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:09,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1123592725, now seen corresponding path program 1 times [2024-10-11 05:57:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:09,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519556999] [2024-10-11 05:57:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:09,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:09,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:09,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519556999] [2024-10-11 05:57:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519556999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:09,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:57:09,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237952478] [2024-10-11 05:57:09,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:09,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:57:09,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:09,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:57:09,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:57:09,985 INFO L87 Difference]: Start difference. First operand 872 states and 1260 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:10,138 INFO L93 Difference]: Finished difference Result 1579 states and 2273 transitions. [2024-10-11 05:57:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:10,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 254 [2024-10-11 05:57:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:10,140 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:10,141 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:10,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 05:57:10,142 INFO L432 NwaCegarLoop]: 1185 mSDtfsCounter, 1081 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:10,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 2372 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4452133794694348) internal successors, (1253), 867 states have internal predecessors, (1253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1259 transitions. [2024-10-11 05:57:10,158 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1259 transitions. Word has length 254 [2024-10-11 05:57:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:10,159 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1259 transitions. [2024-10-11 05:57:10,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1259 transitions. [2024-10-11 05:57:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-11 05:57:10,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:10,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:10,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 05:57:10,161 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:10,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:10,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2021285335, now seen corresponding path program 1 times [2024-10-11 05:57:10,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:10,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661077650] [2024-10-11 05:57:10,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:10,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:10,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661077650] [2024-10-11 05:57:10,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661077650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:10,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:10,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:10,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811524547] [2024-10-11 05:57:10,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:10,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:10,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:10,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:10,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:10,880 INFO L87 Difference]: Start difference. First operand 872 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:11,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:11,065 INFO L93 Difference]: Finished difference Result 1579 states and 2271 transitions. [2024-10-11 05:57:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:11,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 255 [2024-10-11 05:57:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:11,068 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:11,068 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:11,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:11,070 INFO L432 NwaCegarLoop]: 1185 mSDtfsCounter, 1095 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:11,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 2378 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4440599769319493) internal successors, (1252), 867 states have internal predecessors, (1252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1258 transitions. [2024-10-11 05:57:11,085 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1258 transitions. Word has length 255 [2024-10-11 05:57:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:11,085 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1258 transitions. [2024-10-11 05:57:11,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1258 transitions. [2024-10-11 05:57:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-11 05:57:11,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:11,087 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:11,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-11 05:57:11,088 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:11,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:11,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1993769004, now seen corresponding path program 1 times [2024-10-11 05:57:11,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:11,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137033512] [2024-10-11 05:57:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:12,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:12,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137033512] [2024-10-11 05:57:12,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137033512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:12,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137493115] [2024-10-11 05:57:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:12,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:12,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:12,008 INFO L87 Difference]: Start difference. First operand 872 states and 1258 transitions. Second operand has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:12,184 INFO L93 Difference]: Finished difference Result 1579 states and 2269 transitions. [2024-10-11 05:57:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:12,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 256 [2024-10-11 05:57:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:12,187 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:12,187 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:12,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:12,188 INFO L432 NwaCegarLoop]: 1185 mSDtfsCounter, 2164 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:12,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 2372 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4429065743944636) internal successors, (1251), 867 states have internal predecessors, (1251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1257 transitions. [2024-10-11 05:57:12,211 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1257 transitions. Word has length 256 [2024-10-11 05:57:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:12,211 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1257 transitions. [2024-10-11 05:57:12,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1257 transitions. [2024-10-11 05:57:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-11 05:57:12,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:12,213 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:12,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 05:57:12,214 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:12,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash 248362920, now seen corresponding path program 1 times [2024-10-11 05:57:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:12,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928433767] [2024-10-11 05:57:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:12,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928433767] [2024-10-11 05:57:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928433767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:57:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122898299] [2024-10-11 05:57:12,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:12,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:57:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:12,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:57:12,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:57:12,816 INFO L87 Difference]: Start difference. First operand 872 states and 1257 transitions. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:12,873 INFO L93 Difference]: Finished difference Result 1579 states and 2267 transitions. [2024-10-11 05:57:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 257 [2024-10-11 05:57:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:12,875 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:12,875 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:12,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 05:57:12,876 INFO L432 NwaCegarLoop]: 1232 mSDtfsCounter, 1115 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 2466 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:12,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 2466 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:57:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.441753171856978) internal successors, (1250), 867 states have internal predecessors, (1250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1256 transitions. [2024-10-11 05:57:12,892 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1256 transitions. Word has length 257 [2024-10-11 05:57:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:12,892 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1256 transitions. [2024-10-11 05:57:12,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1256 transitions. [2024-10-11 05:57:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-11 05:57:12,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:12,894 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:12,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-11 05:57:12,894 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:12,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash -829450264, now seen corresponding path program 1 times [2024-10-11 05:57:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868894616] [2024-10-11 05:57:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:13,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:13,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:13,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868894616] [2024-10-11 05:57:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868894616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:13,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:13,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:57:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412676522] [2024-10-11 05:57:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:57:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:57:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:57:13,509 INFO L87 Difference]: Start difference. First operand 872 states and 1256 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:13,757 INFO L93 Difference]: Finished difference Result 1579 states and 2265 transitions. [2024-10-11 05:57:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 258 [2024-10-11 05:57:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:13,760 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:13,760 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:13,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 05:57:13,761 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1061 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:13,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 2212 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:57:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:13,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4405997693194925) internal successors, (1249), 867 states have internal predecessors, (1249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1255 transitions. [2024-10-11 05:57:13,779 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1255 transitions. Word has length 258 [2024-10-11 05:57:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:13,779 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1255 transitions. [2024-10-11 05:57:13,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1255 transitions. [2024-10-11 05:57:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-11 05:57:13,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:13,781 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:13,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-11 05:57:13,781 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:13,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1583102196, now seen corresponding path program 1 times [2024-10-11 05:57:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670543420] [2024-10-11 05:57:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:14,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:14,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:14,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670543420] [2024-10-11 05:57:14,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670543420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:14,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:14,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900747048] [2024-10-11 05:57:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:14,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:14,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:14,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:14,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:14,531 INFO L87 Difference]: Start difference. First operand 872 states and 1255 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:14,810 INFO L93 Difference]: Finished difference Result 1579 states and 2263 transitions. [2024-10-11 05:57:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 259 [2024-10-11 05:57:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:14,812 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:14,812 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:14,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:14,813 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 2114 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:14,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 2212 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:57:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.439446366782007) internal successors, (1248), 867 states have internal predecessors, (1248), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1254 transitions. [2024-10-11 05:57:14,829 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1254 transitions. Word has length 259 [2024-10-11 05:57:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:14,830 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1254 transitions. [2024-10-11 05:57:14,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1254 transitions. [2024-10-11 05:57:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-11 05:57:14,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:14,832 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:14,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-11 05:57:14,832 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:14,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash -962455447, now seen corresponding path program 1 times [2024-10-11 05:57:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:14,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365554946] [2024-10-11 05:57:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:15,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365554946] [2024-10-11 05:57:15,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365554946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:15,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:15,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458049689] [2024-10-11 05:57:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:15,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:15,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:15,521 INFO L87 Difference]: Start difference. First operand 872 states and 1254 transitions. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:15,766 INFO L93 Difference]: Finished difference Result 1579 states and 2261 transitions. [2024-10-11 05:57:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:15,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 260 [2024-10-11 05:57:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:15,768 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:15,768 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:15,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:15,770 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1058 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:15,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 2218 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:57:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4382929642445212) internal successors, (1247), 867 states have internal predecessors, (1247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1253 transitions. [2024-10-11 05:57:15,786 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1253 transitions. Word has length 260 [2024-10-11 05:57:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:15,787 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1253 transitions. [2024-10-11 05:57:15,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1253 transitions. [2024-10-11 05:57:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 05:57:15,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:15,789 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:15,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-11 05:57:15,789 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:15,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash -242106805, now seen corresponding path program 1 times [2024-10-11 05:57:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:15,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473598870] [2024-10-11 05:57:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:16,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473598870] [2024-10-11 05:57:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473598870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:16,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:16,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458870389] [2024-10-11 05:57:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:16,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:16,520 INFO L87 Difference]: Start difference. First operand 872 states and 1253 transitions. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:16,844 INFO L93 Difference]: Finished difference Result 1579 states and 2259 transitions. [2024-10-11 05:57:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:16,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 261 [2024-10-11 05:57:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:16,848 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:16,848 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:16,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:16,850 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1057 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:16,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 2218 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:57:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4371395617070357) internal successors, (1246), 867 states have internal predecessors, (1246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1252 transitions. [2024-10-11 05:57:16,866 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1252 transitions. Word has length 261 [2024-10-11 05:57:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:16,866 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1252 transitions. [2024-10-11 05:57:16,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1252 transitions. [2024-10-11 05:57:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-11 05:57:16,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:16,868 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:16,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-11 05:57:16,868 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:16,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash 381994346, now seen corresponding path program 1 times [2024-10-11 05:57:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:16,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251215373] [2024-10-11 05:57:16,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:17,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251215373] [2024-10-11 05:57:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251215373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:17,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005425461] [2024-10-11 05:57:17,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:17,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:17,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:17,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:17,588 INFO L87 Difference]: Start difference. First operand 872 states and 1252 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:17,867 INFO L93 Difference]: Finished difference Result 1579 states and 2257 transitions. [2024-10-11 05:57:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:17,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 262 [2024-10-11 05:57:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:17,870 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:17,870 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:17,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:17,872 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 2096 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2096 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:17,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2096 Valid, 2212 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:57:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4359861591695502) internal successors, (1245), 867 states have internal predecessors, (1245), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1251 transitions. [2024-10-11 05:57:17,890 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1251 transitions. Word has length 262 [2024-10-11 05:57:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:17,891 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1251 transitions. [2024-10-11 05:57:17,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1251 transitions. [2024-10-11 05:57:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-11 05:57:17,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:17,893 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:17,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-11 05:57:17,893 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:17,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:17,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1933791498, now seen corresponding path program 1 times [2024-10-11 05:57:17,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:17,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010750223] [2024-10-11 05:57:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:18,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:18,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:18,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:18,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010750223] [2024-10-11 05:57:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010750223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:18,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:18,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030915137] [2024-10-11 05:57:18,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:18,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:18,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:18,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:18,519 INFO L87 Difference]: Start difference. First operand 872 states and 1251 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:18,783 INFO L93 Difference]: Finished difference Result 1579 states and 2255 transitions. [2024-10-11 05:57:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:18,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 263 [2024-10-11 05:57:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:18,785 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:18,785 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:18,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:18,786 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1055 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:18,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 2218 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:57:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4348327566320647) internal successors, (1244), 867 states have internal predecessors, (1244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1250 transitions. [2024-10-11 05:57:18,804 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1250 transitions. Word has length 263 [2024-10-11 05:57:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:18,804 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1250 transitions. [2024-10-11 05:57:18,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1250 transitions. [2024-10-11 05:57:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-11 05:57:18,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:18,806 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:18,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-11 05:57:18,807 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:18,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash 187961067, now seen corresponding path program 1 times [2024-10-11 05:57:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808607037] [2024-10-11 05:57:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808607037] [2024-10-11 05:57:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808607037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:19,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144843915] [2024-10-11 05:57:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:19,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:19,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:19,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:19,402 INFO L87 Difference]: Start difference. First operand 872 states and 1250 transitions. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:19,643 INFO L93 Difference]: Finished difference Result 1579 states and 2253 transitions. [2024-10-11 05:57:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 264 [2024-10-11 05:57:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:19,646 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:19,646 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:19,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:19,647 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1054 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:19,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2218 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:57:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.433679354094579) internal successors, (1243), 867 states have internal predecessors, (1243), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1249 transitions. [2024-10-11 05:57:19,664 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1249 transitions. Word has length 264 [2024-10-11 05:57:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:19,665 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1249 transitions. [2024-10-11 05:57:19,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1249 transitions. [2024-10-11 05:57:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-10-11 05:57:19,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:19,666 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:19,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-11 05:57:19,667 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:19,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash 118755145, now seen corresponding path program 1 times [2024-10-11 05:57:19,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:19,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891474100] [2024-10-11 05:57:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:19,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:20,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:20,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891474100] [2024-10-11 05:57:20,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891474100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:20,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:20,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920825607] [2024-10-11 05:57:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:20,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:20,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:20,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:20,359 INFO L87 Difference]: Start difference. First operand 872 states and 1249 transitions. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:20,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:20,604 INFO L93 Difference]: Finished difference Result 1579 states and 2251 transitions. [2024-10-11 05:57:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:20,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 265 [2024-10-11 05:57:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:20,606 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:20,607 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:20,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:20,608 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1053 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:20,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 2218 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:57:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4325259515570934) internal successors, (1242), 867 states have internal predecessors, (1242), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1248 transitions. [2024-10-11 05:57:20,626 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1248 transitions. Word has length 265 [2024-10-11 05:57:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1248 transitions. [2024-10-11 05:57:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1248 transitions. [2024-10-11 05:57:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-11 05:57:20,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:20,629 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:20,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-11 05:57:20,629 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:20,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1446798572, now seen corresponding path program 1 times [2024-10-11 05:57:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:20,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173927882] [2024-10-11 05:57:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:21,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:21,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:21,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:21,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173927882] [2024-10-11 05:57:21,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173927882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:21,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:21,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:21,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743959787] [2024-10-11 05:57:21,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:21,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:21,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:21,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:21,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:21,307 INFO L87 Difference]: Start difference. First operand 872 states and 1248 transitions. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:21,539 INFO L93 Difference]: Finished difference Result 1579 states and 2249 transitions. [2024-10-11 05:57:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:21,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 266 [2024-10-11 05:57:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:21,541 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:21,541 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:21,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:21,542 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 2072 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2072 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:21,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2072 Valid, 2212 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:57:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4313725490196079) internal successors, (1241), 867 states have internal predecessors, (1241), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1247 transitions. [2024-10-11 05:57:21,558 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1247 transitions. Word has length 266 [2024-10-11 05:57:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:21,558 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1247 transitions. [2024-10-11 05:57:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1247 transitions. [2024-10-11 05:57:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-11 05:57:21,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:21,560 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-11 05:57:21,561 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash -120616696, now seen corresponding path program 1 times [2024-10-11 05:57:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:21,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931820148] [2024-10-11 05:57:21,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:57:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:57:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:22,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:57:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:57:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931820148] [2024-10-11 05:57:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931820148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:22,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018494810] [2024-10-11 05:57:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:22,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:22,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:22,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:22,153 INFO L87 Difference]: Start difference. First operand 872 states and 1247 transitions. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:22,399 INFO L93 Difference]: Finished difference Result 1579 states and 2247 transitions. [2024-10-11 05:57:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:22,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 267 [2024-10-11 05:57:22,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:22,401 INFO L225 Difference]: With dead ends: 1579 [2024-10-11 05:57:22,401 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 05:57:22,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:22,403 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 2066 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:22,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 2212 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:57:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 05:57:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2024-10-11 05:57:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 867 states have (on average 1.4302191464821223) internal successors, (1240), 867 states have internal predecessors, (1240), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:57:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1246 transitions. [2024-10-11 05:57:22,420 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1246 transitions. Word has length 267 [2024-10-11 05:57:22,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:22,421 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1246 transitions. [2024-10-11 05:57:22,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:57:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1246 transitions. [2024-10-11 05:57:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-11 05:57:22,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:22,423 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:22,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-11 05:57:22,424 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:22,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:22,424 INFO L85 PathProgramCache]: Analyzing trace with hash -851822739, now seen corresponding path program 1 times [2024-10-11 05:57:22,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:22,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746701422] [2024-10-11 05:57:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms