./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_w32_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:05:55,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:05:55,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 06:05:55,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:05:55,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:05:55,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:05:55,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:05:55,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:05:55,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:05:55,257 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:05:55,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:05:55,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:05:55,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:05:55,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:05:55,259 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:05:55,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:05:55,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:05:55,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 06:05:55,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:05:55,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:05:55,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:05:55,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:05:55,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:05:55,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:05:55,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:05:55,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:05:55,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:05:55,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:05:55,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:05:55,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:05:55,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:05:55,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:05:55,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:05:55,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 06:05:55,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 06:05:55,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:05:55,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:05:55,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:05:55,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:05:55,266 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa [2024-10-14 06:05:55,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:05:55,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:05:55,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:05:55,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:05:55,515 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:05:55,516 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_w32_d8_e0.c [2024-10-14 06:05:56,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:05:57,091 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:05:57,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2024-10-14 06:05:57,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534e77637/3f09f41962a349b48bd7a7f900d9469a/FLAG7680dac62 [2024-10-14 06:05:57,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534e77637/3f09f41962a349b48bd7a7f900d9469a [2024-10-14 06:05:57,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:05:57,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:05:57,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:05:57,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:05:57,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:05:57,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a1e72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57, skipping insertion in model container [2024-10-14 06:05:57,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:05:57,301 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_w32_d8_e0.c[1279,1292] [2024-10-14 06:05:57,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:05:57,452 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:05:57,461 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_w32_d8_e0.c[1279,1292] [2024-10-14 06:05:57,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:05:57,648 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:05:57,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57 WrapperNode [2024-10-14 06:05:57,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:05:57,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:05:57,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:05:57,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:05:57,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,806 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1383 [2024-10-14 06:05:57,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:05:57,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:05:57,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:05:57,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:05:57,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,908 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-14 06:05:57,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:57,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:58,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:58,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:05:58,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:05:58,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:05:58,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:05:58,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (1/1) ... [2024-10-14 06:05:58,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:05:58,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:05:58,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:05:58,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:05:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:05:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 06:05:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 06:05:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 06:05:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:05:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:05:58,281 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:05:58,284 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:05:59,599 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-14 06:05:59,599 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:05:59,638 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:05:59,638 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:05:59,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:05:59 BoogieIcfgContainer [2024-10-14 06:05:59,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:05:59,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:05:59,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:05:59,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:05:59,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:05:57" (1/3) ... [2024-10-14 06:05:59,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116bb32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:05:59, skipping insertion in model container [2024-10-14 06:05:59,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:57" (2/3) ... [2024-10-14 06:05:59,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116bb32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:05:59, skipping insertion in model container [2024-10-14 06:05:59,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:05:59" (3/3) ... [2024-10-14 06:05:59,646 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2024-10-14 06:05:59,661 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:05:59,661 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:05:59,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:05:59,744 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;@64d1415a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:05:59,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:05:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 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-14 06:05:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 06:05:59,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:05:59,769 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] [2024-10-14 06:05:59,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:05:59,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:05:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1358744025, now seen corresponding path program 1 times [2024-10-14 06:05:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:05:59,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165792840] [2024-10-14 06:05:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:05:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:05:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:00,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:00,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:00,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-14 06:06:00,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165792840] [2024-10-14 06:06:00,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165792840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:00,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:00,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 06:06:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469910214] [2024-10-14 06:06:00,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 06:06:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:00,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 06:06:00,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 06:06:00,234 INFO L87 Difference]: Start difference. First operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 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 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-14 06:06:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:00,295 INFO L93 Difference]: Finished difference Result 708 states and 1058 transitions. [2024-10-14 06:06:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 06:06:00,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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 116 [2024-10-14 06:06:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:00,307 INFO L225 Difference]: With dead ends: 708 [2024-10-14 06:06:00,307 INFO L226 Difference]: Without dead ends: 388 [2024-10-14 06:06:00,311 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-14 06:06:00,314 INFO L432 NwaCegarLoop]: 575 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, 575 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-14 06:06:00,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-14 06:06:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-14 06:06:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 383 states have internal predecessors, (570), 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-14 06:06:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 576 transitions. [2024-10-14 06:06:00,375 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 576 transitions. Word has length 116 [2024-10-14 06:06:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:00,376 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 576 transitions. [2024-10-14 06:06:00,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-14 06:06:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 576 transitions. [2024-10-14 06:06:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 06:06:00,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:00,379 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] [2024-10-14 06:06:00,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 06:06:00,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:00,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:00,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1080158561, now seen corresponding path program 1 times [2024-10-14 06:06:00,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:00,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993273941] [2024-10-14 06:06:00,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:01,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:01,200 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-14 06:06:01,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993273941] [2024-10-14 06:06:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993273941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:01,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:01,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148395015] [2024-10-14 06:06:01,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:01,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:01,206 INFO L87 Difference]: Start difference. First operand 388 states and 576 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-14 06:06:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:01,255 INFO L93 Difference]: Finished difference Result 392 states and 580 transitions. [2024-10-14 06:06:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 116 [2024-10-14 06:06:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:01,258 INFO L225 Difference]: With dead ends: 392 [2024-10-14 06:06:01,258 INFO L226 Difference]: Without dead ends: 390 [2024-10-14 06:06:01,259 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-14 06:06:01,260 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 0 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1714 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-14 06:06:01,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1714 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-14 06:06:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-14 06:06:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 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-14 06:06:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-10-14 06:06:01,273 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 116 [2024-10-14 06:06:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:01,275 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-10-14 06:06:01,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-14 06:06:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-10-14 06:06:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 06:06:01,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:01,277 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] [2024-10-14 06:06:01,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 06:06:01,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:01,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash -873127207, now seen corresponding path program 1 times [2024-10-14 06:06:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960403703] [2024-10-14 06:06:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:01,627 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-14 06:06:01,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:01,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960403703] [2024-10-14 06:06:01,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960403703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:01,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:01,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:01,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429326001] [2024-10-14 06:06:01,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:01,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:01,649 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-14 06:06:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:02,006 INFO L93 Difference]: Finished difference Result 970 states and 1440 transitions. [2024-10-14 06:06:02,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:06:02,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 117 [2024-10-14 06:06:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:02,010 INFO L225 Difference]: With dead ends: 970 [2024-10-14 06:06:02,012 INFO L226 Difference]: Without dead ends: 390 [2024-10-14 06:06:02,013 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-14 06:06:02,015 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 1090 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:02,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1682 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:06:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-14 06:06:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-14 06:06:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.483116883116883) internal successors, (571), 385 states have internal predecessors, (571), 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-14 06:06:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 577 transitions. [2024-10-14 06:06:02,040 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 577 transitions. Word has length 117 [2024-10-14 06:06:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:02,041 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 577 transitions. [2024-10-14 06:06:02,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-14 06:06:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 577 transitions. [2024-10-14 06:06:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 06:06:02,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:02,045 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] [2024-10-14 06:06:02,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 06:06:02,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:02,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 52997019, now seen corresponding path program 1 times [2024-10-14 06:06:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:02,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026050396] [2024-10-14 06:06:02,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:02,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:02,364 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-14 06:06:02,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:02,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026050396] [2024-10-14 06:06:02,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026050396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:02,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:02,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388550603] [2024-10-14 06:06:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:02,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:02,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:02,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:02,366 INFO L87 Difference]: Start difference. First operand 390 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-14 06:06:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:02,415 INFO L93 Difference]: Finished difference Result 713 states and 1054 transitions. [2024-10-14 06:06:02,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:02,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 118 [2024-10-14 06:06:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:02,418 INFO L225 Difference]: With dead ends: 713 [2024-10-14 06:06:02,418 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:02,419 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-14 06:06:02,420 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1708 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-14 06:06:02,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1708 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 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-14 06:06:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-10-14 06:06:02,432 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 118 [2024-10-14 06:06:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:02,432 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-10-14 06:06:02,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-14 06:06:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-10-14 06:06:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 06:06:02,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:02,434 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] [2024-10-14 06:06:02,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 06:06:02,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:02,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash 544942264, now seen corresponding path program 1 times [2024-10-14 06:06:02,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:02,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39980722] [2024-10-14 06:06:02,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:02,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:02,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:02,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:02,864 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-14 06:06:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:02,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39980722] [2024-10-14 06:06:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39980722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:02,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:02,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670714295] [2024-10-14 06:06:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:02,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:02,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:02,869 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-14 06:06:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:02,964 INFO L93 Difference]: Finished difference Result 715 states and 1055 transitions. [2024-10-14 06:06:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 119 [2024-10-14 06:06:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:02,966 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:02,966 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:02,967 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-14 06:06:02,969 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 480 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1066 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-14 06:06:02,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1066 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4780361757105944) internal successors, (572), 387 states have internal predecessors, (572), 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-14 06:06:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 578 transitions. [2024-10-14 06:06:02,979 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 578 transitions. Word has length 119 [2024-10-14 06:06:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:02,979 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 578 transitions. [2024-10-14 06:06:02,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-14 06:06:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 578 transitions. [2024-10-14 06:06:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 06:06:02,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:02,981 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] [2024-10-14 06:06:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 06:06:02,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1208713513, now seen corresponding path program 1 times [2024-10-14 06:06:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980883591] [2024-10-14 06:06:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:03,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:03,262 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-14 06:06:03,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:03,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980883591] [2024-10-14 06:06:03,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980883591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:03,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:03,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:03,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704750454] [2024-10-14 06:06:03,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:03,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:03,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:03,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:03,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:03,264 INFO L87 Difference]: Start difference. First operand 392 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-14 06:06:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:03,346 INFO L93 Difference]: Finished difference Result 719 states and 1058 transitions. [2024-10-14 06:06:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:06:03,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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 120 [2024-10-14 06:06:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:03,348 INFO L225 Difference]: With dead ends: 719 [2024-10-14 06:06:03,348 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:03,349 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-14 06:06:03,350 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 487 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:03,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1667 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.475452196382429) internal successors, (571), 387 states have internal predecessors, (571), 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-14 06:06:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions. [2024-10-14 06:06:03,362 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 120 [2024-10-14 06:06:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:03,363 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 577 transitions. [2024-10-14 06:06:03,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-14 06:06:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions. [2024-10-14 06:06:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 06:06:03,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:03,364 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] [2024-10-14 06:06:03,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 06:06:03,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:03,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1275297526, now seen corresponding path program 1 times [2024-10-14 06:06:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915473431] [2024-10-14 06:06:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:03,651 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-14 06:06:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915473431] [2024-10-14 06:06:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915473431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:03,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:03,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674232399] [2024-10-14 06:06:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:03,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:03,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:03,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:03,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:03,653 INFO L87 Difference]: Start difference. First operand 392 states and 577 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-14 06:06:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:03,746 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2024-10-14 06:06:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:03,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 121 [2024-10-14 06:06:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:03,748 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:03,748 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:03,749 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-14 06:06:03,749 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 1039 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1066 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-14 06:06:03,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1066 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4728682170542635) internal successors, (570), 387 states have internal predecessors, (570), 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-14 06:06:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions. [2024-10-14 06:06:03,759 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 121 [2024-10-14 06:06:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:03,759 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 576 transitions. [2024-10-14 06:06:03,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-14 06:06:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 576 transitions. [2024-10-14 06:06:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 06:06:03,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:03,760 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] [2024-10-14 06:06:03,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 06:06:03,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:03,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash -178047970, now seen corresponding path program 1 times [2024-10-14 06:06:03,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:03,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262837178] [2024-10-14 06:06:03,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:03,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,038 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-14 06:06:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:04,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262837178] [2024-10-14 06:06:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262837178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:04,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:04,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825337261] [2024-10-14 06:06:04,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:04,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:04,040 INFO L87 Difference]: Start difference. First operand 392 states and 576 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-14 06:06:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:04,134 INFO L93 Difference]: Finished difference Result 715 states and 1049 transitions. [2024-10-14 06:06:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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 122 [2024-10-14 06:06:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:04,138 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:04,138 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:04,139 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-14 06:06:04,140 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 555 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1072 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-14 06:06:04,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1072 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 387 states have internal predecessors, (569), 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-14 06:06:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2024-10-14 06:06:04,151 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 122 [2024-10-14 06:06:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:04,151 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2024-10-14 06:06:04,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-14 06:06:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2024-10-14 06:06:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 06:06:04,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:04,152 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] [2024-10-14 06:06:04,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 06:06:04,153 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:04,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1899068650, now seen corresponding path program 1 times [2024-10-14 06:06:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:04,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017545032] [2024-10-14 06:06:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:04,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,538 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-14 06:06:04,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017545032] [2024-10-14 06:06:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017545032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:04,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:04,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:04,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735088113] [2024-10-14 06:06:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:04,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:04,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:04,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:04,540 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-14 06:06:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:04,602 INFO L93 Difference]: Finished difference Result 715 states and 1047 transitions. [2024-10-14 06:06:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:04,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 123 [2024-10-14 06:06:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:04,605 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:04,605 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:04,605 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-14 06:06:04,606 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 484 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1098 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:04,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1098 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:04,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4677002583979328) internal successors, (568), 387 states have internal predecessors, (568), 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-14 06:06:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2024-10-14 06:06:04,618 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 123 [2024-10-14 06:06:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:04,619 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2024-10-14 06:06:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-14 06:06:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2024-10-14 06:06:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 06:06:04,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:04,620 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] [2024-10-14 06:06:04,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 06:06:04,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:04,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash -129347291, now seen corresponding path program 1 times [2024-10-14 06:06:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111417090] [2024-10-14 06:06:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:04,918 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-14 06:06:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111417090] [2024-10-14 06:06:04,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111417090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:04,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:04,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769553935] [2024-10-14 06:06:04,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:04,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:04,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:04,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:04,920 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-14 06:06:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:04,988 INFO L93 Difference]: Finished difference Result 715 states and 1045 transitions. [2024-10-14 06:06:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 124 [2024-10-14 06:06:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:04,991 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:04,991 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:04,992 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-14 06:06:04,992 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 1037 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:04,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1098 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4651162790697674) internal successors, (567), 387 states have internal predecessors, (567), 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-14 06:06:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2024-10-14 06:06:05,002 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 124 [2024-10-14 06:06:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:05,003 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2024-10-14 06:06:05,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-14 06:06:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2024-10-14 06:06:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 06:06:05,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:05,004 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] [2024-10-14 06:06:05,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 06:06:05,005 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:05,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash -577416317, now seen corresponding path program 1 times [2024-10-14 06:06:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515641410] [2024-10-14 06:06:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:05,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:05,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 06:06:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:05,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 06:06:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:05,336 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-14 06:06:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515641410] [2024-10-14 06:06:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515641410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:05,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:05,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:05,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094798039] [2024-10-14 06:06:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:05,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:05,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:05,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:05,339 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-14 06:06:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:05,395 INFO L93 Difference]: Finished difference Result 715 states and 1043 transitions. [2024-10-14 06:06:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:05,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 125 [2024-10-14 06:06:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:05,397 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:05,397 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:05,398 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-14 06:06:05,399 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 519 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1106 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-14 06:06:05,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1106 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4625322997416021) internal successors, (566), 387 states have internal predecessors, (566), 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-14 06:06:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2024-10-14 06:06:05,408 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 572 transitions. Word has length 125 [2024-10-14 06:06:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:05,409 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 572 transitions. [2024-10-14 06:06:05,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-14 06:06:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 572 transitions. [2024-10-14 06:06:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 06:06:05,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:05,410 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] [2024-10-14 06:06:05,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 06:06:05,410 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:05,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:05,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1617002421, now seen corresponding path program 1 times [2024-10-14 06:06:05,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:05,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665081506] [2024-10-14 06:06:05,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:05,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 06:06:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 06:06:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:05,859 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-14 06:06:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665081506] [2024-10-14 06:06:05,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665081506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:05,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:05,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719135628] [2024-10-14 06:06:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:05,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:05,861 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-14 06:06:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:05,974 INFO L93 Difference]: Finished difference Result 715 states and 1041 transitions. [2024-10-14 06:06:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 126 [2024-10-14 06:06:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:05,976 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:05,976 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:05,977 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-14 06:06:05,978 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 474 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:05,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1585 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 387 states have internal predecessors, (565), 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-14 06:06:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 571 transitions. [2024-10-14 06:06:05,987 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 571 transitions. Word has length 126 [2024-10-14 06:06:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:05,987 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 571 transitions. [2024-10-14 06:06:05,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-14 06:06:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 571 transitions. [2024-10-14 06:06:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 06:06:05,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:05,988 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] [2024-10-14 06:06:05,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 06:06:05,989 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:05,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 384933465, now seen corresponding path program 1 times [2024-10-14 06:06:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637414148] [2024-10-14 06:06:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:06,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 06:06:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:06,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 06:06:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:06,402 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-14 06:06:06,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:06,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637414148] [2024-10-14 06:06:06,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637414148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:06,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882868813] [2024-10-14 06:06:06,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:06,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:06,405 INFO L87 Difference]: Start difference. First operand 392 states and 571 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-14 06:06:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:06,507 INFO L93 Difference]: Finished difference Result 715 states and 1039 transitions. [2024-10-14 06:06:06,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:06,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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 127 [2024-10-14 06:06:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:06,510 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:06,510 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:06,511 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-14 06:06:06,511 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 938 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1060 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-14 06:06:06,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1060 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4573643410852712) internal successors, (564), 387 states have internal predecessors, (564), 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-14 06:06:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 570 transitions. [2024-10-14 06:06:06,522 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 570 transitions. Word has length 127 [2024-10-14 06:06:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:06,522 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 570 transitions. [2024-10-14 06:06:06,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-14 06:06:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 570 transitions. [2024-10-14 06:06:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 06:06:06,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:06,523 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] [2024-10-14 06:06:06,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 06:06:06,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:06,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1126086004, now seen corresponding path program 1 times [2024-10-14 06:06:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004753646] [2024-10-14 06:06:06,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:06,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 06:06:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 06:06:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:06,927 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-14 06:06:06,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:06,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004753646] [2024-10-14 06:06:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004753646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:06,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:06,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:06,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382134725] [2024-10-14 06:06:06,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:06,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:06,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:06,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:06,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:06,930 INFO L87 Difference]: Start difference. First operand 392 states and 570 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-14 06:06:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:07,044 INFO L93 Difference]: Finished difference Result 715 states and 1037 transitions. [2024-10-14 06:06:07,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:07,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 128 [2024-10-14 06:06:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:07,047 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:07,047 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:07,048 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-14 06:06:07,048 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 470 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1066 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-14 06:06:07,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1066 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.454780361757106) internal successors, (563), 387 states have internal predecessors, (563), 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-14 06:06:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 569 transitions. [2024-10-14 06:06:07,060 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 569 transitions. Word has length 128 [2024-10-14 06:06:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:07,060 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 569 transitions. [2024-10-14 06:06:07,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-14 06:06:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 569 transitions. [2024-10-14 06:06:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 06:06:07,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:07,062 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] [2024-10-14 06:06:07,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 06:06:07,062 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:07,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1478743000, now seen corresponding path program 1 times [2024-10-14 06:06:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:07,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748088023] [2024-10-14 06:06:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:07,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:07,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 06:06:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:07,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 06:06:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:07,339 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-14 06:06:07,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748088023] [2024-10-14 06:06:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748088023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114800922] [2024-10-14 06:06:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:07,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:07,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:07,341 INFO L87 Difference]: Start difference. First operand 392 states and 569 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-14 06:06:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:07,400 INFO L93 Difference]: Finished difference Result 715 states and 1035 transitions. [2024-10-14 06:06:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:07,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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 129 [2024-10-14 06:06:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:07,402 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:07,402 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:07,404 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-14 06:06:07,405 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 514 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1100 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-14 06:06:07,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4521963824289406) internal successors, (562), 387 states have internal predecessors, (562), 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-14 06:06:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2024-10-14 06:06:07,415 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 129 [2024-10-14 06:06:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:07,415 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2024-10-14 06:06:07,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-14 06:06:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2024-10-14 06:06:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 06:06:07,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:07,417 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] [2024-10-14 06:06:07,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 06:06:07,418 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:07,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash -23884227, now seen corresponding path program 1 times [2024-10-14 06:06:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661514459] [2024-10-14 06:06:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:07,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:07,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:07,715 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-14 06:06:07,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:07,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661514459] [2024-10-14 06:06:07,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661514459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:07,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:07,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:07,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860005769] [2024-10-14 06:06:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:07,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:07,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:07,719 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-14 06:06:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:07,783 INFO L93 Difference]: Finished difference Result 715 states and 1033 transitions. [2024-10-14 06:06:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 130 [2024-10-14 06:06:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:07,787 INFO L225 Difference]: With dead ends: 715 [2024-10-14 06:06:07,787 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 06:06:07,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-14 06:06:07,788 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 474 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1088 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-14 06:06:07,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1088 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 06:06:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 06:06:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.449612403100775) internal successors, (561), 387 states have internal predecessors, (561), 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-14 06:06:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 567 transitions. [2024-10-14 06:06:07,800 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 567 transitions. Word has length 130 [2024-10-14 06:06:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:07,801 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 567 transitions. [2024-10-14 06:06:07,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-14 06:06:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 567 transitions. [2024-10-14 06:06:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 06:06:07,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:07,802 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] [2024-10-14 06:06:07,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 06:06:07,803 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:07,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1259931877, now seen corresponding path program 1 times [2024-10-14 06:06:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040447731] [2024-10-14 06:06:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:08,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:08,307 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-14 06:06:08,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040447731] [2024-10-14 06:06:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040447731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:08,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:08,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:08,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187132455] [2024-10-14 06:06:08,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:08,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:08,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:08,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:08,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:08,309 INFO L87 Difference]: Start difference. First operand 392 states and 567 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-14 06:06:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:08,496 INFO L93 Difference]: Finished difference Result 721 states and 1039 transitions. [2024-10-14 06:06:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:06:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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 131 [2024-10-14 06:06:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:08,499 INFO L225 Difference]: With dead ends: 721 [2024-10-14 06:06:08,499 INFO L226 Difference]: Without dead ends: 396 [2024-10-14 06:06:08,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:08,500 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 2 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:08,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2074 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 06:06:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-14 06:06:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2024-10-14 06:06:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4473007712082262) internal successors, (563), 389 states have internal predecessors, (563), 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-14 06:06:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 569 transitions. [2024-10-14 06:06:08,515 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 569 transitions. Word has length 131 [2024-10-14 06:06:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:08,515 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 569 transitions. [2024-10-14 06:06:08,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-14 06:06:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 569 transitions. [2024-10-14 06:06:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 06:06:08,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:08,516 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] [2024-10-14 06:06:08,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 06:06:08,517 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1011320282, now seen corresponding path program 1 times [2024-10-14 06:06:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:08,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197384726] [2024-10-14 06:06:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:08,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:09,230 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-14 06:06:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:09,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197384726] [2024-10-14 06:06:09,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197384726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:09,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:09,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068231104] [2024-10-14 06:06:09,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:09,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:09,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:09,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:09,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:09,233 INFO L87 Difference]: Start difference. First operand 394 states and 569 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-14 06:06:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:09,277 INFO L93 Difference]: Finished difference Result 765 states and 1092 transitions. [2024-10-14 06:06:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:06:09,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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 132 [2024-10-14 06:06:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:09,279 INFO L225 Difference]: With dead ends: 765 [2024-10-14 06:06:09,279 INFO L226 Difference]: Without dead ends: 440 [2024-10-14 06:06:09,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:09,281 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 19 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2218 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-14 06:06:09,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2218 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-14 06:06:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2024-10-14 06:06:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.4226327944572748) internal successors, (616), 433 states have internal predecessors, (616), 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-14 06:06:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 622 transitions. [2024-10-14 06:06:09,293 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 622 transitions. Word has length 132 [2024-10-14 06:06:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:09,293 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 622 transitions. [2024-10-14 06:06:09,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-14 06:06:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 622 transitions. [2024-10-14 06:06:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 06:06:09,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:09,295 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] [2024-10-14 06:06:09,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 06:06:09,296 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:09,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2099922208, now seen corresponding path program 1 times [2024-10-14 06:06:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:09,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169629514] [2024-10-14 06:06:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:09,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:09,923 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-14 06:06:09,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:09,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169629514] [2024-10-14 06:06:09,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169629514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:09,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:09,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 06:06:09,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785924638] [2024-10-14 06:06:09,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:09,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:06:09,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:06:09,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:06:09,927 INFO L87 Difference]: Start difference. First operand 438 states and 622 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-14 06:06:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:10,036 INFO L93 Difference]: Finished difference Result 973 states and 1363 transitions. [2024-10-14 06:06:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:06:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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 133 [2024-10-14 06:06:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:10,039 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:10,039 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:10,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:06:10,041 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 861 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:10,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2196 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3942953020134228) internal successors, (831), 596 states have internal predecessors, (831), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 843 transitions. [2024-10-14 06:06:10,059 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 843 transitions. Word has length 133 [2024-10-14 06:06:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:10,059 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 843 transitions. [2024-10-14 06:06:10,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-14 06:06:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 843 transitions. [2024-10-14 06:06:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-10-14 06:06:10,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:10,063 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:06:10,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 06:06:10,063 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:10,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash -527063259, now seen corresponding path program 1 times [2024-10-14 06:06:10,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:10,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201138859] [2024-10-14 06:06:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:10,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:10,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 06:06:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:10,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-14 06:06:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:10,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-14 06:06:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:10,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:10,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201138859] [2024-10-14 06:06:10,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201138859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:10,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:10,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:10,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347658820] [2024-10-14 06:06:10,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:10,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:10,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:10,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:10,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:10,702 INFO L87 Difference]: Start difference. First operand 604 states and 843 transitions. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:10,789 INFO L93 Difference]: Finished difference Result 973 states and 1362 transitions. [2024-10-14 06:06:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 321 [2024-10-14 06:06:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:10,791 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:10,791 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:10,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-14 06:06:10,793 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 515 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:10,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1062 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3926174496644295) internal successors, (830), 596 states have internal predecessors, (830), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 842 transitions. [2024-10-14 06:06:10,814 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 842 transitions. Word has length 321 [2024-10-14 06:06:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:10,815 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 842 transitions. [2024-10-14 06:06:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 842 transitions. [2024-10-14 06:06:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-14 06:06:10,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:10,818 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:06:10,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 06:06:10,818 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1995936863, now seen corresponding path program 1 times [2024-10-14 06:06:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:10,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487182716] [2024-10-14 06:06:10,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:11,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-14 06:06:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:11,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-14 06:06:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-14 06:06:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487182716] [2024-10-14 06:06:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487182716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:11,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:11,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:11,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67551014] [2024-10-14 06:06:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:11,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:11,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:11,494 INFO L87 Difference]: Start difference. First operand 604 states and 842 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:11,579 INFO L93 Difference]: Finished difference Result 973 states and 1360 transitions. [2024-10-14 06:06:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:11,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 322 [2024-10-14 06:06:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:11,583 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:11,583 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:11,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-14 06:06:11,586 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 507 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:11,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1062 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3909395973154361) internal successors, (829), 596 states have internal predecessors, (829), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 841 transitions. [2024-10-14 06:06:11,603 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 841 transitions. Word has length 322 [2024-10-14 06:06:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:11,604 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 841 transitions. [2024-10-14 06:06:11,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 841 transitions. [2024-10-14 06:06:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-14 06:06:11,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:11,607 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:06:11,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 06:06:11,607 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:11,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1240803152, now seen corresponding path program 1 times [2024-10-14 06:06:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609589034] [2024-10-14 06:06:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-14 06:06:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 06:06:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-14 06:06:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:12,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:12,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609589034] [2024-10-14 06:06:12,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609589034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:12,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:12,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716978145] [2024-10-14 06:06:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:12,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:12,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:12,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:12,224 INFO L87 Difference]: Start difference. First operand 604 states and 841 transitions. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:12,317 INFO L93 Difference]: Finished difference Result 973 states and 1358 transitions. [2024-10-14 06:06:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:12,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2024-10-14 06:06:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:12,320 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:12,320 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:12,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-14 06:06:12,322 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 499 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:12,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1062 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.389261744966443) internal successors, (828), 596 states have internal predecessors, (828), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 840 transitions. [2024-10-14 06:06:12,340 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 840 transitions. Word has length 323 [2024-10-14 06:06:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:12,341 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 840 transitions. [2024-10-14 06:06:12,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 840 transitions. [2024-10-14 06:06:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-14 06:06:12,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:12,344 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:06:12,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 06:06:12,344 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:12,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2068867158, now seen corresponding path program 1 times [2024-10-14 06:06:12,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:12,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685689615] [2024-10-14 06:06:12,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:12,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-14 06:06:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 06:06:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-14 06:06:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:12,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:12,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685689615] [2024-10-14 06:06:12,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685689615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:12,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:12,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:12,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993137578] [2024-10-14 06:06:12,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:12,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:12,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:12,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:12,941 INFO L87 Difference]: Start difference. First operand 604 states and 840 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:13,022 INFO L93 Difference]: Finished difference Result 973 states and 1356 transitions. [2024-10-14 06:06:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:13,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2024-10-14 06:06:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:13,024 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:13,024 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:13,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-14 06:06:13,026 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 891 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:13,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1056 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3875838926174497) internal successors, (827), 596 states have internal predecessors, (827), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 839 transitions. [2024-10-14 06:06:13,041 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 839 transitions. Word has length 324 [2024-10-14 06:06:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:13,042 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 839 transitions. [2024-10-14 06:06:13,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 839 transitions. [2024-10-14 06:06:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-14 06:06:13,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:13,045 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:06:13,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 06:06:13,045 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:13,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:13,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1727343621, now seen corresponding path program 1 times [2024-10-14 06:06:13,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:13,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132540571] [2024-10-14 06:06:13,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:13,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:13,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-14 06:06:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:13,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-14 06:06:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-14 06:06:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132540571] [2024-10-14 06:06:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132540571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:13,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444301552] [2024-10-14 06:06:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:13,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:13,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:13,662 INFO L87 Difference]: Start difference. First operand 604 states and 839 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:13,720 INFO L93 Difference]: Finished difference Result 973 states and 1354 transitions. [2024-10-14 06:06:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2024-10-14 06:06:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:13,724 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:13,724 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:13,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-14 06:06:13,725 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 476 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:13,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1086 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:13,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3859060402684564) internal successors, (826), 596 states have internal predecessors, (826), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 838 transitions. [2024-10-14 06:06:13,740 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 838 transitions. Word has length 325 [2024-10-14 06:06:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:13,740 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 838 transitions. [2024-10-14 06:06:13,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 838 transitions. [2024-10-14 06:06:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-14 06:06:13,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:13,744 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:06:13,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 06:06:13,744 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:13,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:13,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1491267445, now seen corresponding path program 1 times [2024-10-14 06:06:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:13,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202317602] [2024-10-14 06:06:13,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:14,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:14,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:14,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-14 06:06:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:14,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-14 06:06:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-14 06:06:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:14,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202317602] [2024-10-14 06:06:14,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202317602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:14,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:14,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036607561] [2024-10-14 06:06:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:14,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:14,290 INFO L87 Difference]: Start difference. First operand 604 states and 838 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:14,361 INFO L93 Difference]: Finished difference Result 973 states and 1352 transitions. [2024-10-14 06:06:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:14,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-10-14 06:06:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:14,363 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:14,364 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:14,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-14 06:06:14,365 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 852 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:14,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1080 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3842281879194631) internal successors, (825), 596 states have internal predecessors, (825), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 837 transitions. [2024-10-14 06:06:14,407 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 837 transitions. Word has length 326 [2024-10-14 06:06:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:14,407 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 837 transitions. [2024-10-14 06:06:14,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 837 transitions. [2024-10-14 06:06:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-14 06:06:14,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:14,414 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:06:14,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 06:06:14,415 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1635488474, now seen corresponding path program 1 times [2024-10-14 06:06:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188419462] [2024-10-14 06:06:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:15,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:15,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:15,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-14 06:06:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:15,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-14 06:06:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:15,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-14 06:06:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:15,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:15,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188419462] [2024-10-14 06:06:15,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188419462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:15,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:15,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565643909] [2024-10-14 06:06:15,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:15,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:15,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:15,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:15,193 INFO L87 Difference]: Start difference. First operand 604 states and 837 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:15,442 INFO L93 Difference]: Finished difference Result 973 states and 1350 transitions. [2024-10-14 06:06:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2024-10-14 06:06:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:15,445 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:15,445 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:15,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-14 06:06:15,446 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 454 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 806 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:15,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 806 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 06:06:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3825503355704698) internal successors, (824), 596 states have internal predecessors, (824), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 836 transitions. [2024-10-14 06:06:15,458 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 836 transitions. Word has length 327 [2024-10-14 06:06:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:15,459 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 836 transitions. [2024-10-14 06:06:15,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 836 transitions. [2024-10-14 06:06:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-14 06:06:15,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:15,462 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:06:15,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 06:06:15,462 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:15,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1908581440, now seen corresponding path program 1 times [2024-10-14 06:06:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:15,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886686494] [2024-10-14 06:06:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:16,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:16,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:16,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-14 06:06:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:16,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-14 06:06:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:16,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-14 06:06:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:16,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:16,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886686494] [2024-10-14 06:06:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886686494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:16,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:16,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801035215] [2024-10-14 06:06:16,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:16,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:16,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:16,435 INFO L87 Difference]: Start difference. First operand 604 states and 836 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:16,489 INFO L93 Difference]: Finished difference Result 973 states and 1348 transitions. [2024-10-14 06:06:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:16,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2024-10-14 06:06:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:16,491 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:16,492 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:16,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-14 06:06:16,493 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 383 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1078 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-14 06:06:16,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1078 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3808724832214765) internal successors, (823), 596 states have internal predecessors, (823), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 835 transitions. [2024-10-14 06:06:16,508 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 835 transitions. Word has length 328 [2024-10-14 06:06:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:16,508 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 835 transitions. [2024-10-14 06:06:16,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 835 transitions. [2024-10-14 06:06:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-14 06:06:16,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:16,510 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:06:16,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 06:06:16,511 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:16,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1642191244, now seen corresponding path program 1 times [2024-10-14 06:06:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:16,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305375305] [2024-10-14 06:06:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:17,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:17,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:17,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-14 06:06:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:17,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-14 06:06:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:17,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-14 06:06:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:17,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305375305] [2024-10-14 06:06:17,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305375305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:17,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994174111] [2024-10-14 06:06:17,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:17,431 INFO L87 Difference]: Start difference. First operand 604 states and 835 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:17,524 INFO L93 Difference]: Finished difference Result 973 states and 1346 transitions. [2024-10-14 06:06:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:17,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2024-10-14 06:06:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:17,527 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:17,527 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:17,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-14 06:06:17,528 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 865 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:17,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1048 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3791946308724832) internal successors, (822), 596 states have internal predecessors, (822), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 834 transitions. [2024-10-14 06:06:17,545 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 834 transitions. Word has length 329 [2024-10-14 06:06:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:17,545 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 834 transitions. [2024-10-14 06:06:17,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 834 transitions. [2024-10-14 06:06:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-14 06:06:17,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:17,553 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:17,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 06:06:17,554 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:17,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1362929664, now seen corresponding path program 1 times [2024-10-14 06:06:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:17,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499163727] [2024-10-14 06:06:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:18,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 06:06:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:18,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-14 06:06:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-14 06:06:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:18,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:18,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499163727] [2024-10-14 06:06:18,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499163727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:18,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:18,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:18,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052193784] [2024-10-14 06:06:18,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:18,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:18,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:18,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:18,409 INFO L87 Difference]: Start difference. First operand 604 states and 834 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:18,511 INFO L93 Difference]: Finished difference Result 973 states and 1344 transitions. [2024-10-14 06:06:18,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2024-10-14 06:06:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:18,520 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:18,520 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:18,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-14 06:06:18,522 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 855 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:18,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1048 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:18,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3775167785234899) internal successors, (821), 596 states have internal predecessors, (821), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 833 transitions. [2024-10-14 06:06:18,538 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 833 transitions. Word has length 330 [2024-10-14 06:06:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:18,538 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 833 transitions. [2024-10-14 06:06:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 833 transitions. [2024-10-14 06:06:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-10-14 06:06:18,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:18,541 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:18,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 06:06:18,541 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash -252416955, now seen corresponding path program 1 times [2024-10-14 06:06:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409915747] [2024-10-14 06:06:18,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:19,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-14 06:06:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:19,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-14 06:06:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:19,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-14 06:06:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:19,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:19,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409915747] [2024-10-14 06:06:19,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409915747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:19,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:19,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207510120] [2024-10-14 06:06:19,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:19,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:19,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:19,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:19,446 INFO L87 Difference]: Start difference. First operand 604 states and 833 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:19,521 INFO L93 Difference]: Finished difference Result 973 states and 1342 transitions. [2024-10-14 06:06:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2024-10-14 06:06:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:19,525 INFO L225 Difference]: With dead ends: 973 [2024-10-14 06:06:19,525 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 06:06:19,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-14 06:06:19,526 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 392 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:19,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1048 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 06:06:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-10-14 06:06:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 1.3758389261744965) internal successors, (820), 596 states have internal predecessors, (820), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 832 transitions. [2024-10-14 06:06:19,542 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 832 transitions. Word has length 331 [2024-10-14 06:06:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:19,543 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 832 transitions. [2024-10-14 06:06:19,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 832 transitions. [2024-10-14 06:06:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-14 06:06:19,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:19,546 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:19,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 06:06:19,546 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:19,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash 848291183, now seen corresponding path program 1 times [2024-10-14 06:06:19,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078998281] [2024-10-14 06:06:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:20,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:20,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:20,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-14 06:06:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:20,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-14 06:06:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:20,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-14 06:06:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-14 06:06:20,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:20,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078998281] [2024-10-14 06:06:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078998281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566671244] [2024-10-14 06:06:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:20,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:20,928 INFO L87 Difference]: Start difference. First operand 604 states and 832 transitions. Second operand has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:21,204 INFO L93 Difference]: Finished difference Result 1053 states and 1436 transitions. [2024-10-14 06:06:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:06:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-10-14 06:06:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:21,207 INFO L225 Difference]: With dead ends: 1053 [2024-10-14 06:06:21,207 INFO L226 Difference]: Without dead ends: 612 [2024-10-14 06:06:21,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-14 06:06:21,209 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 469 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:21,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1200 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:06:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-14 06:06:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2024-10-14 06:06:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3733333333333333) internal successors, (824), 600 states have internal predecessors, (824), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 836 transitions. [2024-10-14 06:06:21,223 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 836 transitions. Word has length 332 [2024-10-14 06:06:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:21,223 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 836 transitions. [2024-10-14 06:06:21,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 836 transitions. [2024-10-14 06:06:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-14 06:06:21,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:21,227 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:21,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 06:06:21,228 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:21,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1390299249, now seen corresponding path program 1 times [2024-10-14 06:06:21,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:21,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661154555] [2024-10-14 06:06:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:21,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:22,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:22,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:22,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-14 06:06:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:22,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-14 06:06:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-14 06:06:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-14 06:06:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661154555] [2024-10-14 06:06:22,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661154555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:22,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:06:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438047428] [2024-10-14 06:06:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:22,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:06:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:22,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:06:22,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:06:22,107 INFO L87 Difference]: Start difference. First operand 608 states and 836 transitions. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:22,267 INFO L93 Difference]: Finished difference Result 1055 states and 1434 transitions. [2024-10-14 06:06:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:06:22,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-10-14 06:06:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:22,269 INFO L225 Difference]: With dead ends: 1055 [2024-10-14 06:06:22,269 INFO L226 Difference]: Without dead ends: 608 [2024-10-14 06:06:22,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-14 06:06:22,271 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 2 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:22,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1491 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-14 06:06:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-14 06:06:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3666666666666667) internal successors, (820), 600 states have internal predecessors, (820), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 06:06:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 832 transitions. [2024-10-14 06:06:22,288 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 832 transitions. Word has length 332 [2024-10-14 06:06:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:22,288 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 832 transitions. [2024-10-14 06:06:22,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 832 transitions. [2024-10-14 06:06:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-14 06:06:22,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:22,291 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:22,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 06:06:22,291 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:22,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 744328405, now seen corresponding path program 1 times [2024-10-14 06:06:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:22,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436728544] [2024-10-14 06:06:22,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:23,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:23,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-14 06:06:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-14 06:06:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:23,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-14 06:06:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436728544] [2024-10-14 06:06:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436728544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 06:06:23,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689542313] [2024-10-14 06:06:23,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:23,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:06:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:23,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:06:23,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:06:23,151 INFO L87 Difference]: Start difference. First operand 608 states and 832 transitions. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:23,546 INFO L93 Difference]: Finished difference Result 1422 states and 1953 transitions. [2024-10-14 06:06:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:06:23,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2024-10-14 06:06:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:23,550 INFO L225 Difference]: With dead ends: 1422 [2024-10-14 06:06:23,550 INFO L226 Difference]: Without dead ends: 1051 [2024-10-14 06:06:23,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-14 06:06:23,551 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 567 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:23,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 2094 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 06:06:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-14 06:06:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 935. [2024-10-14 06:06:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 924 states have (on average 1.3625541125541125) internal successors, (1259), 924 states have internal predecessors, (1259), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 06:06:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1277 transitions. [2024-10-14 06:06:23,572 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1277 transitions. Word has length 334 [2024-10-14 06:06:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:23,572 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1277 transitions. [2024-10-14 06:06:23,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1277 transitions. [2024-10-14 06:06:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-14 06:06:23,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:23,575 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:23,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 06:06:23,575 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:23,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:23,576 INFO L85 PathProgramCache]: Analyzing trace with hash -101311359, now seen corresponding path program 1 times [2024-10-14 06:06:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340214949] [2024-10-14 06:06:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:23,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:24,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:24,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-14 06:06:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-14 06:06:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:24,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-14 06:06:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340214949] [2024-10-14 06:06:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340214949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:24,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:24,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 06:06:24,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838663718] [2024-10-14 06:06:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:24,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:06:24,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:06:24,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:06:24,573 INFO L87 Difference]: Start difference. First operand 935 states and 1277 transitions. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:25,041 INFO L93 Difference]: Finished difference Result 1329 states and 1819 transitions. [2024-10-14 06:06:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:06:25,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-10-14 06:06:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:25,045 INFO L225 Difference]: With dead ends: 1329 [2024-10-14 06:06:25,046 INFO L226 Difference]: Without dead ends: 958 [2024-10-14 06:06:25,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:06:25,048 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 1010 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:25,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1559 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 06:06:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-14 06:06:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 936. [2024-10-14 06:06:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 925 states have (on average 1.3621621621621622) internal successors, (1260), 925 states have internal predecessors, (1260), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 06:06:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1278 transitions. [2024-10-14 06:06:25,073 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1278 transitions. Word has length 335 [2024-10-14 06:06:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:25,074 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1278 transitions. [2024-10-14 06:06:25,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1278 transitions. [2024-10-14 06:06:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-14 06:06:25,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:25,079 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:25,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 06:06:25,080 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:25,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1966033512, now seen corresponding path program 1 times [2024-10-14 06:06:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:25,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685569541] [2024-10-14 06:06:25,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:25,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 06:06:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 06:06:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 06:06:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-14 06:06:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-14 06:06:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-14 06:06:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-14 06:06:26,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685569541] [2024-10-14 06:06:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685569541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:26,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:26,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 06:06:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949371069] [2024-10-14 06:06:26,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:26,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:06:26,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:26,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:06:26,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:06:26,443 INFO L87 Difference]: Start difference. First operand 936 states and 1278 transitions. Second operand has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:26,602 INFO L93 Difference]: Finished difference Result 2113 states and 2876 transitions. [2024-10-14 06:06:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 06:06:26,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-10-14 06:06:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:26,607 INFO L225 Difference]: With dead ends: 2113 [2024-10-14 06:06:26,607 INFO L226 Difference]: Without dead ends: 1624 [2024-10-14 06:06:26,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:06:26,609 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 822 mSDsluCounter, 5521 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 6807 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-14 06:06:26,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 6807 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:06:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-10-14 06:06:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1003. [2024-10-14 06:06:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 989 states have (on average 1.366026289180991) internal successors, (1351), 989 states have internal predecessors, (1351), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 06:06:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1375 transitions. [2024-10-14 06:06:26,634 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1375 transitions. Word has length 335 [2024-10-14 06:06:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:26,634 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1375 transitions. [2024-10-14 06:06:26,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1375 transitions. [2024-10-14 06:06:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-10-14 06:06:26,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:26,637 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:26,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 06:06:26,637 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:26,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash 541248472, now seen corresponding path program 1 times [2024-10-14 06:06:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:26,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143166223] [2024-10-14 06:06:26,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 06:06:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:27,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 06:06:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 06:06:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-14 06:06:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-14 06:06:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:27,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-14 06:06:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-14 06:06:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:27,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143166223] [2024-10-14 06:06:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143166223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:27,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:27,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 06:06:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42109705] [2024-10-14 06:06:27,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:27,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:06:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:06:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:06:27,603 INFO L87 Difference]: Start difference. First operand 1003 states and 1375 transitions. Second operand has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:27,847 INFO L93 Difference]: Finished difference Result 2131 states and 2918 transitions. [2024-10-14 06:06:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:06:27,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-10-14 06:06:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:27,853 INFO L225 Difference]: With dead ends: 2131 [2024-10-14 06:06:27,853 INFO L226 Difference]: Without dead ends: 1019 [2024-10-14 06:06:27,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 06:06:27,856 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 630 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:27,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 2501 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 06:06:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-10-14 06:06:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1011. [2024-10-14 06:06:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 997 states have (on average 1.3590772316950852) internal successors, (1355), 997 states have internal predecessors, (1355), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 06:06:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1379 transitions. [2024-10-14 06:06:27,879 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1379 transitions. Word has length 336 [2024-10-14 06:06:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:27,879 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1379 transitions. [2024-10-14 06:06:27,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1379 transitions. [2024-10-14 06:06:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-14 06:06:27,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:27,882 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:27,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 06:06:27,882 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:27,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:27,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1114654100, now seen corresponding path program 1 times [2024-10-14 06:06:27,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:27,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947212636] [2024-10-14 06:06:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:27,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:29,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 06:06:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:29,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 06:06:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 06:06:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-14 06:06:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-14 06:06:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:29,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-14 06:06:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-14 06:06:29,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:29,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947212636] [2024-10-14 06:06:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947212636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:29,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:29,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 06:06:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855070350] [2024-10-14 06:06:29,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:29,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:06:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:06:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:06:29,047 INFO L87 Difference]: Start difference. First operand 1011 states and 1379 transitions. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:29,660 INFO L93 Difference]: Finished difference Result 2517 states and 3402 transitions. [2024-10-14 06:06:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 06:06:29,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 338 [2024-10-14 06:06:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:29,666 INFO L225 Difference]: With dead ends: 2517 [2024-10-14 06:06:29,667 INFO L226 Difference]: Without dead ends: 1877 [2024-10-14 06:06:29,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-14 06:06:29,669 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 909 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:29,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 2416 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 06:06:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-10-14 06:06:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1869. [2024-10-14 06:06:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1843 states have (on average 1.3505154639175259) internal successors, (2489), 1843 states have internal predecessors, (2489), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 06:06:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2537 transitions. [2024-10-14 06:06:29,705 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2537 transitions. Word has length 338 [2024-10-14 06:06:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:29,706 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2537 transitions. [2024-10-14 06:06:29,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2537 transitions. [2024-10-14 06:06:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-14 06:06:29,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:29,710 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:29,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 06:06:29,711 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:29,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash 366505692, now seen corresponding path program 1 times [2024-10-14 06:06:29,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:29,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539446939] [2024-10-14 06:06:29,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:29,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:30,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 06:06:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 06:06:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 06:06:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:30,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-14 06:06:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:30,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-14 06:06:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:30,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-14 06:06:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-14 06:06:30,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:30,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539446939] [2024-10-14 06:06:30,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539446939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:30,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:30,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 06:06:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543170668] [2024-10-14 06:06:30,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:30,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:06:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:06:30,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:06:30,676 INFO L87 Difference]: Start difference. First operand 1869 states and 2537 transitions. Second operand has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 06:06:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:31,065 INFO L93 Difference]: Finished difference Result 3532 states and 4783 transitions. [2024-10-14 06:06:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:06:31,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 340 [2024-10-14 06:06:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:31,071 INFO L225 Difference]: With dead ends: 3532 [2024-10-14 06:06:31,071 INFO L226 Difference]: Without dead ends: 1901 [2024-10-14 06:06:31,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:06:31,074 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1035 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:31,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1547 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:06:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2024-10-14 06:06:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1885. [2024-10-14 06:06:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1859 states have (on average 1.3431952662721893) internal successors, (2497), 1859 states have internal predecessors, (2497), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 06:06:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2545 transitions. [2024-10-14 06:06:31,140 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2545 transitions. Word has length 340 [2024-10-14 06:06:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:31,140 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 2545 transitions. [2024-10-14 06:06:31,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 06:06:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2545 transitions. [2024-10-14 06:06:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-14 06:06:31,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:31,145 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:31,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 06:06:31,145 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:31,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:31,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1624562388, now seen corresponding path program 1 times [2024-10-14 06:06:31,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:31,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650886233] [2024-10-14 06:06:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:31,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:32,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 06:06:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 06:06:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:32,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 06:06:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 06:06:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:32,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-14 06:06:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:32,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-14 06:06:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-14 06:06:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:32,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650886233] [2024-10-14 06:06:32,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650886233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:32,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 06:06:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545548603] [2024-10-14 06:06:32,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:32,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:06:32,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:32,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:06:32,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:06:32,102 INFO L87 Difference]: Start difference. First operand 1885 states and 2545 transitions. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 06:06:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:32,490 INFO L93 Difference]: Finished difference Result 3512 states and 4733 transitions. [2024-10-14 06:06:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:06:32,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 342 [2024-10-14 06:06:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:32,496 INFO L225 Difference]: With dead ends: 3512 [2024-10-14 06:06:32,496 INFO L226 Difference]: Without dead ends: 1901 [2024-10-14 06:06:32,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:06:32,499 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 498 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:32,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1547 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:06:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2024-10-14 06:06:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1893. [2024-10-14 06:06:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1867 states have (on average 1.3417246920192822) internal successors, (2505), 1867 states have internal predecessors, (2505), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 06:06:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2553 transitions. [2024-10-14 06:06:32,537 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2553 transitions. Word has length 342 [2024-10-14 06:06:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:32,538 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 2553 transitions. [2024-10-14 06:06:32,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 06:06:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2553 transitions. [2024-10-14 06:06:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-14 06:06:32,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:32,543 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:32,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 06:06:32,543 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:32,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash -526007198, now seen corresponding path program 1 times [2024-10-14 06:06:32,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:32,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239114269] [2024-10-14 06:06:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:32,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:33,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 06:06:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:33,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 06:06:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 06:06:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 06:06:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-14 06:06:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:33,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-10-14 06:06:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-14 06:06:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:33,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239114269] [2024-10-14 06:06:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239114269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:33,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 06:06:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090554160] [2024-10-14 06:06:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:33,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:06:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:06:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:06:33,750 INFO L87 Difference]: Start difference. First operand 1893 states and 2553 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 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-14 06:06:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:34,110 INFO L93 Difference]: Finished difference Result 1903 states and 2561 transitions. [2024-10-14 06:06:34,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:06:34,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 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 344 [2024-10-14 06:06:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:34,114 INFO L225 Difference]: With dead ends: 1903 [2024-10-14 06:06:34,114 INFO L226 Difference]: Without dead ends: 1031 [2024-10-14 06:06:34,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:06:34,116 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 510 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:34,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1547 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:06:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-10-14 06:06:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1027. [2024-10-14 06:06:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1013 states have (on average 1.3494570582428431) internal successors, (1367), 1013 states have internal predecessors, (1367), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 06:06:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1391 transitions. [2024-10-14 06:06:34,136 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1391 transitions. Word has length 344 [2024-10-14 06:06:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:34,136 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1391 transitions. [2024-10-14 06:06:34,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 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-14 06:06:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1391 transitions. [2024-10-14 06:06:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-14 06:06:34,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:34,140 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:34,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 06:06:34,140 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:34,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:34,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1627115852, now seen corresponding path program 1 times [2024-10-14 06:06:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:34,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941678216] [2024-10-14 06:06:34,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 06:06:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 06:06:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 06:06:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-14 06:06:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:36,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-14 06:06:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:36,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-14 06:06:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-14 06:06:36,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:36,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941678216] [2024-10-14 06:06:36,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941678216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:36,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:36,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 06:06:36,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641877756] [2024-10-14 06:06:36,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:36,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 06:06:36,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:36,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 06:06:36,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:06:36,612 INFO L87 Difference]: Start difference. First operand 1027 states and 1391 transitions. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 06:06:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:37,018 INFO L93 Difference]: Finished difference Result 1982 states and 2678 transitions. [2024-10-14 06:06:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 06:06:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 344 [2024-10-14 06:06:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:37,025 INFO L225 Difference]: With dead ends: 1982 [2024-10-14 06:06:37,026 INFO L226 Difference]: Without dead ends: 1356 [2024-10-14 06:06:37,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-14 06:06:37,030 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 1288 mSDsluCounter, 4453 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 5261 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:37,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 5261 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:06:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-10-14 06:06:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1059. [2024-10-14 06:06:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1043 states have (on average 1.3499520613614573) internal successors, (1408), 1043 states have internal predecessors, (1408), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 06:06:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1436 transitions. [2024-10-14 06:06:37,061 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1436 transitions. Word has length 344 [2024-10-14 06:06:37,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:37,061 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1436 transitions. [2024-10-14 06:06:37,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 06:06:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1436 transitions. [2024-10-14 06:06:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-14 06:06:37,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:37,065 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:37,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 06:06:37,066 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:37,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1968053996, now seen corresponding path program 1 times [2024-10-14 06:06:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572111313] [2024-10-14 06:06:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 06:06:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 06:06:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 06:06:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-14 06:06:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-14 06:06:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-14 06:06:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 4 proven. 82 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:06:38,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:38,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572111313] [2024-10-14 06:06:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572111313] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:06:38,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549122270] [2024-10-14 06:06:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:38,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:06:38,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:06:38,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:06:38,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 06:06:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:39,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 2043 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 06:06:39,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:06:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-14 06:06:40,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:06:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-14 06:06:41,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549122270] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:06:41,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:06:41,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2024-10-14 06:06:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933458451] [2024-10-14 06:06:41,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:06:41,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 06:06:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 06:06:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-10-14 06:06:41,587 INFO L87 Difference]: Start difference. First operand 1059 states and 1436 transitions. Second operand has 25 states, 25 states have (on average 34.08) internal successors, (852), 25 states have internal predecessors, (852), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-14 06:06:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:43,060 INFO L93 Difference]: Finished difference Result 1883 states and 2542 transitions. [2024-10-14 06:06:43,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 06:06:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 34.08) internal successors, (852), 25 states have internal predecessors, (852), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 344 [2024-10-14 06:06:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:43,064 INFO L225 Difference]: With dead ends: 1883 [2024-10-14 06:06:43,064 INFO L226 Difference]: Without dead ends: 1087 [2024-10-14 06:06:43,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=1830, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 06:06:43,066 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 1104 mSDsluCounter, 5910 mSDsCounter, 0 mSdLazyCounter, 3146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 6391 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:43,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 6391 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3146 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 06:06:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-10-14 06:06:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1075. [2024-10-14 06:06:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1059 states have (on average 1.3408876298394712) internal successors, (1420), 1059 states have internal predecessors, (1420), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 06:06:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1448 transitions. [2024-10-14 06:06:43,091 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1448 transitions. Word has length 344 [2024-10-14 06:06:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:43,091 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1448 transitions. [2024-10-14 06:06:43,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 34.08) internal successors, (852), 25 states have internal predecessors, (852), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-14 06:06:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1448 transitions. [2024-10-14 06:06:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-14 06:06:43,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:43,094 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:43,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 06:06:43,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:06:43,295 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:43,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1019445219, now seen corresponding path program 1 times [2024-10-14 06:06:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973526293] [2024-10-14 06:06:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 06:06:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:43,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 06:06:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:43,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 06:06:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:43,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-14 06:06:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-14 06:06:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:43,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-14 06:06:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-14 06:06:43,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:43,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973526293] [2024-10-14 06:06:43,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973526293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:43,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:43,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:06:43,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066157555] [2024-10-14 06:06:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:43,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:06:43,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:06:43,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:43,941 INFO L87 Difference]: Start difference. First operand 1075 states and 1448 transitions. Second operand has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 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-14 06:06:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:43,990 INFO L93 Difference]: Finished difference Result 1753 states and 2365 transitions. [2024-10-14 06:06:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:06:43,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 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 348 [2024-10-14 06:06:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:43,994 INFO L225 Difference]: With dead ends: 1753 [2024-10-14 06:06:43,994 INFO L226 Difference]: Without dead ends: 1131 [2024-10-14 06:06:43,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:06:43,995 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 16 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:43,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2167 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-10-14 06:06:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131. [2024-10-14 06:06:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1115 states have (on average 1.345291479820628) internal successors, (1500), 1115 states have internal predecessors, (1500), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 06:06:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1528 transitions. [2024-10-14 06:06:44,024 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1528 transitions. Word has length 348 [2024-10-14 06:06:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:44,026 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1528 transitions. [2024-10-14 06:06:44,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.2) internal successors, (291), 5 states have internal predecessors, (291), 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-14 06:06:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1528 transitions. [2024-10-14 06:06:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-14 06:06:44,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:44,031 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:44,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-14 06:06:44,031 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:44,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash -72193039, now seen corresponding path program 1 times [2024-10-14 06:06:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:44,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778751143] [2024-10-14 06:06:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 06:06:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 06:06:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 06:06:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-14 06:06:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:45,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-14 06:06:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-14 06:06:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-14 06:06:45,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778751143] [2024-10-14 06:06:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778751143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:45,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:06:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 06:06:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565277659] [2024-10-14 06:06:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:45,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 06:06:45,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:45,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 06:06:45,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:06:45,941 INFO L87 Difference]: Start difference. First operand 1131 states and 1528 transitions. Second operand has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 06:06:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:46,893 INFO L93 Difference]: Finished difference Result 2707 states and 3622 transitions. [2024-10-14 06:06:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 06:06:46,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 349 [2024-10-14 06:06:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:46,897 INFO L225 Difference]: With dead ends: 2707 [2024-10-14 06:06:46,898 INFO L226 Difference]: Without dead ends: 1953 [2024-10-14 06:06:46,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-14 06:06:46,899 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 1343 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 3346 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:46,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 3346 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 06:06:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2024-10-14 06:06:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1304. [2024-10-14 06:06:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1283 states have (on average 1.3468433359314107) internal successors, (1728), 1283 states have internal predecessors, (1728), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 06:06:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1766 transitions. [2024-10-14 06:06:46,926 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1766 transitions. Word has length 349 [2024-10-14 06:06:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:46,927 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1766 transitions. [2024-10-14 06:06:46,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 06:06:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1766 transitions. [2024-10-14 06:06:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-14 06:06:46,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:46,930 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:46,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-14 06:06:46,930 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:46,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1783097521, now seen corresponding path program 1 times [2024-10-14 06:06:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362063291] [2024-10-14 06:06:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:46,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 06:06:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 06:06:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:51,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 06:06:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:51,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-14 06:06:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:51,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-14 06:06:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:51,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-14 06:06:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 36 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-14 06:06:51,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362063291] [2024-10-14 06:06:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362063291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:06:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826853020] [2024-10-14 06:06:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:51,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:06:51,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:06:51,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:06:51,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 06:06:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:52,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 2052 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 06:06:52,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:06:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-14 06:06:52,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:06:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826853020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:52,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 06:06:52,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-10-14 06:06:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900025516] [2024-10-14 06:06:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:52,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:06:52,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:06:52,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-14 06:06:52,991 INFO L87 Difference]: Start difference. First operand 1304 states and 1766 transitions. Second operand has 6 states, 5 states have (on average 55.2) internal successors, (276), 6 states have internal predecessors, (276), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 06:06:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:53,046 INFO L93 Difference]: Finished difference Result 2269 states and 3068 transitions. [2024-10-14 06:06:53,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:06:53,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 55.2) internal successors, (276), 6 states have internal predecessors, (276), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 349 [2024-10-14 06:06:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:53,049 INFO L225 Difference]: With dead ends: 2269 [2024-10-14 06:06:53,049 INFO L226 Difference]: Without dead ends: 1304 [2024-10-14 06:06:53,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-14 06:06:53,051 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:53,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2703 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:06:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2024-10-14 06:06:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2024-10-14 06:06:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1283 states have (on average 1.3390491036632892) internal successors, (1718), 1283 states have internal predecessors, (1718), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 06:06:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1756 transitions. [2024-10-14 06:06:53,075 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1756 transitions. Word has length 349 [2024-10-14 06:06:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:06:53,075 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1756 transitions. [2024-10-14 06:06:53,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 55.2) internal successors, (276), 6 states have internal predecessors, (276), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 06:06:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1756 transitions. [2024-10-14 06:06:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-14 06:06:53,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:06:53,078 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:06:53,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 06:06:53,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-10-14 06:06:53,279 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:06:53,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:06:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1555587349, now seen corresponding path program 1 times [2024-10-14 06:06:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:06:53,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037868101] [2024-10-14 06:06:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:06:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 06:06:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 06:06:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 06:06:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-14 06:06:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-14 06:06:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:58,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-14 06:06:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 36 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-14 06:06:58,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:06:58,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037868101] [2024-10-14 06:06:58,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037868101] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:06:58,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502212868] [2024-10-14 06:06:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:06:58,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:06:58,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:06:58,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:06:58,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 06:06:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:06:59,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 06:06:59,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:06:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 06:06:59,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:06:59,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502212868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:06:59,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 06:06:59,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2024-10-14 06:06:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284533409] [2024-10-14 06:06:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:06:59,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:06:59,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:06:59,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:06:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-10-14 06:06:59,500 INFO L87 Difference]: Start difference. First operand 1304 states and 1756 transitions. Second operand has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:06:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:06:59,988 INFO L93 Difference]: Finished difference Result 2862 states and 3861 transitions. [2024-10-14 06:06:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:06:59,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351 [2024-10-14 06:06:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:06:59,993 INFO L225 Difference]: With dead ends: 2862 [2024-10-14 06:06:59,994 INFO L226 Difference]: Without dead ends: 2277 [2024-10-14 06:06:59,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-10-14 06:06:59,996 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 930 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 06:06:59,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 2255 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 06:06:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2024-10-14 06:07:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 1931. [2024-10-14 06:07:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1895 states have (on average 1.3229551451187336) internal successors, (2507), 1895 states have internal predecessors, (2507), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 06:07:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2575 transitions. [2024-10-14 06:07:00,040 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2575 transitions. Word has length 351 [2024-10-14 06:07:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:07:00,041 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2575 transitions. [2024-10-14 06:07:00,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:07:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2575 transitions. [2024-10-14 06:07:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-14 06:07:00,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:07:00,044 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:07:00,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 06:07:00,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:07:00,245 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:07:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:07:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1735365702, now seen corresponding path program 1 times [2024-10-14 06:07:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:07:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542930101] [2024-10-14 06:07:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:07:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:07:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 06:07:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 06:07:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 06:07:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-14 06:07:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-14 06:07:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-14 06:07:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:07:01,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:07:01,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542930101] [2024-10-14 06:07:01,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542930101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:07:01,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:07:01,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 06:07:01,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670944088] [2024-10-14 06:07:01,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:07:01,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:07:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:07:01,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:07:01,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:07:01,629 INFO L87 Difference]: Start difference. First operand 1931 states and 2575 transitions. Second operand has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:07:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:07:02,096 INFO L93 Difference]: Finished difference Result 3311 states and 4391 transitions. [2024-10-14 06:07:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:07:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2024-10-14 06:07:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:07:02,101 INFO L225 Difference]: With dead ends: 3311 [2024-10-14 06:07:02,101 INFO L226 Difference]: Without dead ends: 2760 [2024-10-14 06:07:02,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:07:02,103 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 699 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 06:07:02,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 2189 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 06:07:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2024-10-14 06:07:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2526. [2024-10-14 06:07:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2490 states have (on average 1.3036144578313253) internal successors, (3246), 2490 states have internal predecessors, (3246), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 06:07:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3314 transitions. [2024-10-14 06:07:02,190 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3314 transitions. Word has length 352 [2024-10-14 06:07:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:07:02,190 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 3314 transitions. [2024-10-14 06:07:02,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:07:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3314 transitions. [2024-10-14 06:07:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-14 06:07:02,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:07:02,195 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:07:02,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-14 06:07:02,195 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:07:02,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:07:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash 921459997, now seen corresponding path program 1 times [2024-10-14 06:07:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:07:02,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018093581] [2024-10-14 06:07:02,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:07:02,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:07:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:06,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 06:07:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:06,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 06:07:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:06,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 06:07:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-14 06:07:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-14 06:07:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-14 06:07:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 50 proven. 37 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:07:06,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:07:06,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018093581] [2024-10-14 06:07:06,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018093581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:07:06,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904341532] [2024-10-14 06:07:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:07:06,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:07:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:07:06,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:07:06,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 06:07:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:07,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 06:07:07,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:07:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-14 06:07:07,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:07:07,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904341532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:07:07,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 06:07:07,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-10-14 06:07:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074267737] [2024-10-14 06:07:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:07:07,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:07:07,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:07:07,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:07:07,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-10-14 06:07:07,497 INFO L87 Difference]: Start difference. First operand 2526 states and 3314 transitions. Second operand has 6 states, 5 states have (on average 55.0) internal successors, (275), 6 states have internal predecessors, (275), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 06:07:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:07:07,551 INFO L93 Difference]: Finished difference Result 4574 states and 5982 transitions. [2024-10-14 06:07:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:07:07,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 55.0) internal successors, (275), 6 states have internal predecessors, (275), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 352 [2024-10-14 06:07:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:07:07,556 INFO L225 Difference]: With dead ends: 4574 [2024-10-14 06:07:07,556 INFO L226 Difference]: Without dead ends: 2526 [2024-10-14 06:07:07,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-10-14 06:07:07,559 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:07:07,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2698 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:07:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2024-10-14 06:07:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2526. [2024-10-14 06:07:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2490 states have (on average 1.3008032128514055) internal successors, (3239), 2490 states have internal predecessors, (3239), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 06:07:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3307 transitions. [2024-10-14 06:07:07,598 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3307 transitions. Word has length 352 [2024-10-14 06:07:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:07:07,598 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 3307 transitions. [2024-10-14 06:07:07,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 55.0) internal successors, (275), 6 states have internal predecessors, (275), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 06:07:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3307 transitions. [2024-10-14 06:07:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-14 06:07:07,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:07:07,603 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 06:07:07,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 06:07:07,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-10-14 06:07:07,804 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:07:07,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:07:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash 775757118, now seen corresponding path program 1 times [2024-10-14 06:07:07,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:07:07,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30967077] [2024-10-14 06:07:07,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:07:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:07:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 06:07:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:09,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 06:07:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:09,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 06:07:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-14 06:07:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:09,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-14 06:07:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-14 06:07:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:07:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 06:07:09,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:07:09,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30967077] [2024-10-14 06:07:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30967077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:07:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:07:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 06:07:09,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228793764] [2024-10-14 06:07:09,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:07:09,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:07:09,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:07:09,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:07:09,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:07:09,097 INFO L87 Difference]: Start difference. First operand 2526 states and 3307 transitions. Second operand has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 06:07:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:07:09,754 INFO L93 Difference]: Finished difference Result 4019 states and 5279 transitions. [2024-10-14 06:07:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 06:07:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2024-10-14 06:07:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:07:09,760 INFO L225 Difference]: With dead ends: 4019 [2024-10-14 06:07:09,760 INFO L226 Difference]: Without dead ends: 3426 [2024-10-14 06:07:09,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-14 06:07:09,763 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 749 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 3795 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 06:07:09,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 3795 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 06:07:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2024-10-14 06:07:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3407. [2024-10-14 06:07:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3407 states, 3363 states have (on average 1.3003270889087124) internal successors, (4373), 3363 states have internal predecessors, (4373), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 06:07:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 4457 transitions. [2024-10-14 06:07:09,816 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 4457 transitions. Word has length 352 [2024-10-14 06:07:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:07:09,817 INFO L471 AbstractCegarLoop]: Abstraction has 3407 states and 4457 transitions. [2024-10-14 06:07:09,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)