./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.arbitrated_top_n4_w8_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c1dfcbee3b3c08868a7bc65611f640bbe908ac332f2cba22ac0e18c87a2548d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:21:20,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:21:20,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:21:20,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:21:20,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:21:20,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:21:20,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:21:20,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:21:20,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:21:20,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:21:20,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:21:20,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:21:20,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:21:20,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:21:20,489 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:21:20,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:21:20,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:21:20,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:21:20,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:21:20,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:21:20,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:21:20,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:21:20,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:21:20,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:21:20,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:21:20,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:21:20,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:21:20,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:21:20,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:21:20,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:21:20,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:21:20,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:21:20,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:21:20,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:21:20,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:21:20,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:21:20,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:21:20,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:21:20,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:21:20,496 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1dfcbee3b3c08868a7bc65611f640bbe908ac332f2cba22ac0e18c87a2548d6 [2024-10-11 05:21:20,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:21:20,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:21:20,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:21:20,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:21:20,776 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:21:20,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c [2024-10-11 05:21:22,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:21:22,582 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:21:22,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c [2024-10-11 05:21:22,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0c963ef0f/fba35c7ef3a34060a37c4ebf9f18cc2f/FLAGa41157d3d [2024-10-11 05:21:22,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0c963ef0f/fba35c7ef3a34060a37c4ebf9f18cc2f [2024-10-11 05:21:22,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:21:22,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:21:22,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:21:22,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:21:22,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:21:22,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:21:22" (1/1) ... [2024-10-11 05:21:22,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145585df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:22, skipping insertion in model container [2024-10-11 05:21:22,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:21:22" (1/1) ... [2024-10-11 05:21:22,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:21:22,950 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.arbitrated_top_n4_w8_d8_e0.c[1269,1282] [2024-10-11 05:21:23,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:21:23,333 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:21:23,343 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.arbitrated_top_n4_w8_d8_e0.c[1269,1282] [2024-10-11 05:21:23,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:21:23,497 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:21:23,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23 WrapperNode [2024-10-11 05:21:23,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:21:23,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:21:23,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:21:23,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:21:23,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:23,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,262 INFO L138 Inliner]: procedures = 17, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4764 [2024-10-11 05:21:24,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:21:24,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:21:24,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:21:24,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:21:24,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,528 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:21:24,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:21:24,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:21:24,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:21:24,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:21:24,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (1/1) ... [2024-10-11 05:21:24,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:21:24,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:21:24,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:21:25,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:21:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:21:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 05:21:25,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 05:21:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:21:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:21:25,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:21:25,597 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:21:25,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:21:30,138 INFO L? ?]: Removed 2675 outVars from TransFormulas that were not future-live. [2024-10-11 05:21:30,138 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:21:30,267 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:21:30,267 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:21:30,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:21:30 BoogieIcfgContainer [2024-10-11 05:21:30,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:21:30,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:21:30,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:21:30,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:21:30,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:21:22" (1/3) ... [2024-10-11 05:21:30,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e6ed6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:21:30, skipping insertion in model container [2024-10-11 05:21:30,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:23" (2/3) ... [2024-10-11 05:21:30,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e6ed6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:21:30, skipping insertion in model container [2024-10-11 05:21:30,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:21:30" (3/3) ... [2024-10-11 05:21:30,279 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c [2024-10-11 05:21:30,297 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:21:30,297 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:21:30,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:21:30,419 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;@5be991bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:21:30,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:21:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 1409 states, 1393 states have (on average 1.4953338119167265) internal successors, (2083), 1394 states have internal predecessors, (2083), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-10-11 05:21:30,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:30,480 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:30,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:30,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1313296762, now seen corresponding path program 1 times [2024-10-11 05:21:30,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154335035] [2024-10-11 05:21:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 05:21:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-11 05:21:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-11 05:21:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-11 05:21:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:21:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-11 05:21:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-11 05:21:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-10-11 05:21:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154335035] [2024-10-11 05:21:33,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154335035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:33,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:33,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:21:33,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718509007] [2024-10-11 05:21:33,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:33,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:21:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:21:33,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:21:33,490 INFO L87 Difference]: Start difference. First operand has 1409 states, 1393 states have (on average 1.4953338119167265) internal successors, (2083), 1394 states have internal predecessors, (2083), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:33,632 INFO L93 Difference]: Finished difference Result 2606 states and 3915 transitions. [2024-10-11 05:21:33,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:33,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 478 [2024-10-11 05:21:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:33,664 INFO L225 Difference]: With dead ends: 2606 [2024-10-11 05:21:33,665 INFO L226 Difference]: Without dead ends: 1410 [2024-10-11 05:21:33,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:21:33,679 INFO L432 NwaCegarLoop]: 2103 mSDtfsCounter, 0 mSDsluCounter, 4201 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6304 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:33,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:21:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-11 05:21:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2024-10-11 05:21:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1395 states have (on average 1.4924731182795699) internal successors, (2082), 1395 states have internal predecessors, (2082), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2108 transitions. [2024-10-11 05:21:33,792 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2108 transitions. Word has length 478 [2024-10-11 05:21:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:33,795 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2108 transitions. [2024-10-11 05:21:33,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2108 transitions. [2024-10-11 05:21:33,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-10-11 05:21:33,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:33,803 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:33,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:21:33,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:33,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2059191711, now seen corresponding path program 1 times [2024-10-11 05:21:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:33,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764110399] [2024-10-11 05:21:33,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:33,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 05:21:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-11 05:21:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-11 05:21:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-11 05:21:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:21:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-11 05:21:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-11 05:21:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-10-11 05:21:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:35,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764110399] [2024-10-11 05:21:35,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764110399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:35,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:35,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241604363] [2024-10-11 05:21:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:35,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:35,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:35,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:35,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:35,381 INFO L87 Difference]: Start difference. First operand 1410 states and 2108 transitions. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:36,625 INFO L93 Difference]: Finished difference Result 3584 states and 5361 transitions. [2024-10-11 05:21:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:21:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 479 [2024-10-11 05:21:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:36,635 INFO L225 Difference]: With dead ends: 3584 [2024-10-11 05:21:36,635 INFO L226 Difference]: Without dead ends: 1410 [2024-10-11 05:21:36,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:21:36,641 INFO L432 NwaCegarLoop]: 2134 mSDtfsCounter, 4178 mSDsluCounter, 3702 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4186 SdHoareTripleChecker+Valid, 5836 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:36,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4186 Valid, 5836 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:21:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-11 05:21:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2024-10-11 05:21:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1395 states have (on average 1.4917562724014337) internal successors, (2081), 1395 states have internal predecessors, (2081), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2107 transitions. [2024-10-11 05:21:36,674 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2107 transitions. Word has length 479 [2024-10-11 05:21:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:36,675 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2107 transitions. [2024-10-11 05:21:36,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2107 transitions. [2024-10-11 05:21:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-10-11 05:21:36,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:36,684 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:36,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:21:36,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:36,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:36,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1874572264, now seen corresponding path program 1 times [2024-10-11 05:21:36,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:36,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456485765] [2024-10-11 05:21:36,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:36,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:37,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:37,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456485765] [2024-10-11 05:21:37,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456485765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:37,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:37,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:37,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094842022] [2024-10-11 05:21:37,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:37,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:37,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:37,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:37,884 INFO L87 Difference]: Start difference. First operand 1410 states and 2107 transitions. Second operand has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:38,916 INFO L93 Difference]: Finished difference Result 2607 states and 3895 transitions. [2024-10-11 05:21:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:38,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 480 [2024-10-11 05:21:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:38,922 INFO L225 Difference]: With dead ends: 2607 [2024-10-11 05:21:38,923 INFO L226 Difference]: Without dead ends: 1410 [2024-10-11 05:21:38,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:38,929 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 1990 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:38,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1995 Valid, 3088 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:21:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-11 05:21:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2024-10-11 05:21:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1395 states have (on average 1.4910394265232976) internal successors, (2080), 1395 states have internal predecessors, (2080), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2106 transitions. [2024-10-11 05:21:38,957 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2106 transitions. Word has length 480 [2024-10-11 05:21:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:38,958 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2106 transitions. [2024-10-11 05:21:38,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2106 transitions. [2024-10-11 05:21:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-10-11 05:21:38,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:38,966 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:38,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:21:38,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:38,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash -317916262, now seen corresponding path program 1 times [2024-10-11 05:21:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783321400] [2024-10-11 05:21:38,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:38,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:40,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783321400] [2024-10-11 05:21:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783321400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:40,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:40,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:40,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072886870] [2024-10-11 05:21:40,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:40,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:40,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:40,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:40,078 INFO L87 Difference]: Start difference. First operand 1410 states and 2106 transitions. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:41,088 INFO L93 Difference]: Finished difference Result 2607 states and 3893 transitions. [2024-10-11 05:21:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:41,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 481 [2024-10-11 05:21:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:41,095 INFO L225 Difference]: With dead ends: 2607 [2024-10-11 05:21:41,095 INFO L226 Difference]: Without dead ends: 1410 [2024-10-11 05:21:41,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:41,100 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 1950 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:41,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 3088 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:21:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-11 05:21:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2024-10-11 05:21:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1395 states have (on average 1.4903225806451612) internal successors, (2079), 1395 states have internal predecessors, (2079), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2105 transitions. [2024-10-11 05:21:41,133 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2105 transitions. Word has length 481 [2024-10-11 05:21:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:41,134 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2105 transitions. [2024-10-11 05:21:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2105 transitions. [2024-10-11 05:21:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-10-11 05:21:41,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:41,143 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:41,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:21:41,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:41,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash 943211853, now seen corresponding path program 1 times [2024-10-11 05:21:41,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:41,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989413860] [2024-10-11 05:21:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989413860] [2024-10-11 05:21:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989413860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:42,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:42,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:42,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315232655] [2024-10-11 05:21:42,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:42,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:42,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:42,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:42,294 INFO L87 Difference]: Start difference. First operand 1410 states and 2105 transitions. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:43,277 INFO L93 Difference]: Finished difference Result 2607 states and 3891 transitions. [2024-10-11 05:21:43,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:43,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 482 [2024-10-11 05:21:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:43,288 INFO L225 Difference]: With dead ends: 2607 [2024-10-11 05:21:43,288 INFO L226 Difference]: Without dead ends: 1410 [2024-10-11 05:21:43,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:43,291 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 3658 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3663 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:43,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3663 Valid, 3072 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:21:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-11 05:21:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2024-10-11 05:21:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1395 states have (on average 1.489605734767025) internal successors, (2078), 1395 states have internal predecessors, (2078), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2104 transitions. [2024-10-11 05:21:43,320 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2104 transitions. Word has length 482 [2024-10-11 05:21:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:43,320 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2104 transitions. [2024-10-11 05:21:43,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2104 transitions. [2024-10-11 05:21:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-10-11 05:21:43,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:43,329 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:43,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:21:43,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:43,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:43,330 INFO L85 PathProgramCache]: Analyzing trace with hash -284221217, now seen corresponding path program 1 times [2024-10-11 05:21:43,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:43,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428583910] [2024-10-11 05:21:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:43,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428583910] [2024-10-11 05:21:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428583910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:44,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:44,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323129606] [2024-10-11 05:21:44,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:44,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:44,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:44,504 INFO L87 Difference]: Start difference. First operand 1410 states and 2104 transitions. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:45,532 INFO L93 Difference]: Finished difference Result 2607 states and 3889 transitions. [2024-10-11 05:21:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:45,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 483 [2024-10-11 05:21:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:45,540 INFO L225 Difference]: With dead ends: 2607 [2024-10-11 05:21:45,540 INFO L226 Difference]: Without dead ends: 1410 [2024-10-11 05:21:45,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:45,544 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 1870 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:45,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 3088 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:21:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-11 05:21:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2024-10-11 05:21:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1395 states have (on average 1.488888888888889) internal successors, (2077), 1395 states have internal predecessors, (2077), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2103 transitions. [2024-10-11 05:21:45,580 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2103 transitions. Word has length 483 [2024-10-11 05:21:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:45,581 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2103 transitions. [2024-10-11 05:21:45,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:21:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2103 transitions. [2024-10-11 05:21:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2024-10-11 05:21:45,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:45,587 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:45,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:21:45,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:45,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:45,589 INFO L85 PathProgramCache]: Analyzing trace with hash -370488782, now seen corresponding path program 1 times [2024-10-11 05:21:45,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:45,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896179546] [2024-10-11 05:21:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896179546] [2024-10-11 05:21:46,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896179546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:46,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:46,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:21:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334690583] [2024-10-11 05:21:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:46,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:21:46,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:46,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:21:46,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:21:46,671 INFO L87 Difference]: Start difference. First operand 1410 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:46,730 INFO L93 Difference]: Finished difference Result 2609 states and 3890 transitions. [2024-10-11 05:21:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:46,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 484 [2024-10-11 05:21:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:46,737 INFO L225 Difference]: With dead ends: 2609 [2024-10-11 05:21:46,738 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:46,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:21:46,742 INFO L432 NwaCegarLoop]: 2098 mSDtfsCounter, 0 mSDsluCounter, 4188 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6286 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:46,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6286 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:21:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.4881889763779528) internal successors, (2079), 1397 states have internal predecessors, (2079), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2105 transitions. [2024-10-11 05:21:46,771 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2105 transitions. Word has length 484 [2024-10-11 05:21:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:46,772 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2105 transitions. [2024-10-11 05:21:46,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2105 transitions. [2024-10-11 05:21:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-10-11 05:21:46,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:46,777 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:46,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:21:46,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:46,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 301786304, now seen corresponding path program 1 times [2024-10-11 05:21:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:46,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097553383] [2024-10-11 05:21:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:48,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:48,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097553383] [2024-10-11 05:21:48,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097553383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:48,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:48,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:21:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725549648] [2024-10-11 05:21:48,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:48,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:21:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:48,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:21:48,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:21:48,166 INFO L87 Difference]: Start difference. First operand 1412 states and 2105 transitions. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:48,485 INFO L93 Difference]: Finished difference Result 2611 states and 3891 transitions. [2024-10-11 05:21:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:48,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 485 [2024-10-11 05:21:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:48,492 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:21:48,492 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:48,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:48,495 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 1822 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:48,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1822 Valid, 3974 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:21:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.4867573371510379) internal successors, (2077), 1397 states have internal predecessors, (2077), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2103 transitions. [2024-10-11 05:21:48,527 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2103 transitions. Word has length 485 [2024-10-11 05:21:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:48,528 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2103 transitions. [2024-10-11 05:21:48,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2103 transitions. [2024-10-11 05:21:48,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2024-10-11 05:21:48,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:48,532 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:48,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:21:48,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 859446371, now seen corresponding path program 1 times [2024-10-11 05:21:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298873083] [2024-10-11 05:21:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298873083] [2024-10-11 05:21:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298873083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568394569] [2024-10-11 05:21:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:49,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:49,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:49,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:49,791 INFO L87 Difference]: Start difference. First operand 1412 states and 2103 transitions. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:50,064 INFO L93 Difference]: Finished difference Result 2611 states and 3887 transitions. [2024-10-11 05:21:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:50,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 487 [2024-10-11 05:21:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:50,071 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:21:50,072 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:50,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:50,075 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 2067 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:50,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2080 Valid, 3990 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:21:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.4860415175375805) internal successors, (2076), 1397 states have internal predecessors, (2076), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2102 transitions. [2024-10-11 05:21:50,109 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2102 transitions. Word has length 487 [2024-10-11 05:21:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:50,110 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2102 transitions. [2024-10-11 05:21:50,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2102 transitions. [2024-10-11 05:21:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-10-11 05:21:50,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:50,115 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:50,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:21:50,116 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 732145177, now seen corresponding path program 1 times [2024-10-11 05:21:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:50,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515074893] [2024-10-11 05:21:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515074893] [2024-10-11 05:21:51,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515074893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:51,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:51,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058089648] [2024-10-11 05:21:51,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:51,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:51,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:51,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:51,158 INFO L87 Difference]: Start difference. First operand 1412 states and 2102 transitions. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:51,438 INFO L93 Difference]: Finished difference Result 2611 states and 3885 transitions. [2024-10-11 05:21:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:51,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 488 [2024-10-11 05:21:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:51,446 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:21:51,446 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:51,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:51,448 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 2028 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2041 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:51,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2041 Valid, 3990 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:21:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.4853256979241232) internal successors, (2075), 1397 states have internal predecessors, (2075), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2101 transitions. [2024-10-11 05:21:51,483 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2101 transitions. Word has length 488 [2024-10-11 05:21:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:51,484 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2101 transitions. [2024-10-11 05:21:51,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2101 transitions. [2024-10-11 05:21:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2024-10-11 05:21:51,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:51,488 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:51,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:21:51,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:51,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1573838605, now seen corresponding path program 1 times [2024-10-11 05:21:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:51,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041241222] [2024-10-11 05:21:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:52,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:52,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041241222] [2024-10-11 05:21:52,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041241222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:52,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:52,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839640915] [2024-10-11 05:21:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:52,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:52,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:52,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:52,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:52,472 INFO L87 Difference]: Start difference. First operand 1412 states and 2101 transitions. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:52,730 INFO L93 Difference]: Finished difference Result 2611 states and 3883 transitions. [2024-10-11 05:21:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 489 [2024-10-11 05:21:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:52,736 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:21:52,736 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:52,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:52,739 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 2024 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2037 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:52,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2037 Valid, 3990 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:21:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.4846098783106658) internal successors, (2074), 1397 states have internal predecessors, (2074), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2100 transitions. [2024-10-11 05:21:52,766 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2100 transitions. Word has length 489 [2024-10-11 05:21:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:52,767 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2100 transitions. [2024-10-11 05:21:52,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2100 transitions. [2024-10-11 05:21:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-11 05:21:52,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:52,771 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:52,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:21:52,772 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:52,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash 503305682, now seen corresponding path program 1 times [2024-10-11 05:21:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805036109] [2024-10-11 05:21:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:52,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805036109] [2024-10-11 05:21:53,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805036109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:53,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:53,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498223374] [2024-10-11 05:21:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:53,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:53,686 INFO L87 Difference]: Start difference. First operand 1412 states and 2100 transitions. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:53,938 INFO L93 Difference]: Finished difference Result 2611 states and 3881 transitions. [2024-10-11 05:21:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:53,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 490 [2024-10-11 05:21:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:53,951 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:21:53,951 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:53,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:53,954 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 1985 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1998 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:53,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1998 Valid, 3990 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:21:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.4838940586972083) internal successors, (2073), 1397 states have internal predecessors, (2073), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2099 transitions. [2024-10-11 05:21:53,988 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2099 transitions. Word has length 490 [2024-10-11 05:21:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:53,989 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2099 transitions. [2024-10-11 05:21:53,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2099 transitions. [2024-10-11 05:21:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-10-11 05:21:53,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:53,993 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:53,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:21:53,993 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1929353475, now seen corresponding path program 1 times [2024-10-11 05:21:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:53,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143303594] [2024-10-11 05:21:53,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:53,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:55,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143303594] [2024-10-11 05:21:55,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143303594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:55,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:55,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:55,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650749197] [2024-10-11 05:21:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:55,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:55,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:55,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:55,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:55,075 INFO L87 Difference]: Start difference. First operand 1412 states and 2099 transitions. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:55,306 INFO L93 Difference]: Finished difference Result 2611 states and 3879 transitions. [2024-10-11 05:21:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:55,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 491 [2024-10-11 05:21:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:55,314 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:21:55,316 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:55,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:55,322 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 1981 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:55,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 3990 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:21:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.483178239083751) internal successors, (2072), 1397 states have internal predecessors, (2072), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2098 transitions. [2024-10-11 05:21:55,352 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2098 transitions. Word has length 491 [2024-10-11 05:21:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:55,353 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2098 transitions. [2024-10-11 05:21:55,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2098 transitions. [2024-10-11 05:21:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-10-11 05:21:55,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:55,357 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:21:55,358 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1130031513, now seen corresponding path program 1 times [2024-10-11 05:21:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765547804] [2024-10-11 05:21:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765547804] [2024-10-11 05:21:56,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765547804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:56,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:56,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:56,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900388700] [2024-10-11 05:21:56,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:56,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:56,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:56,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:56,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:56,210 INFO L87 Difference]: Start difference. First operand 1412 states and 2098 transitions. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:56,440 INFO L93 Difference]: Finished difference Result 2611 states and 3877 transitions. [2024-10-11 05:21:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:56,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 492 [2024-10-11 05:21:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:56,447 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:21:56,447 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:56,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:56,450 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 3632 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3645 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:56,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3645 Valid, 3974 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:21:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.4824624194702936) internal successors, (2071), 1397 states have internal predecessors, (2071), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2097 transitions. [2024-10-11 05:21:56,477 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2097 transitions. Word has length 492 [2024-10-11 05:21:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:56,478 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2097 transitions. [2024-10-11 05:21:56,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2097 transitions. [2024-10-11 05:21:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2024-10-11 05:21:56,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:56,482 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:56,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:21:56,483 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:56,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1774754413, now seen corresponding path program 1 times [2024-10-11 05:21:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:56,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065562053] [2024-10-11 05:21:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:56,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:57,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065562053] [2024-10-11 05:21:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065562053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:57,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:57,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:21:57,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964082963] [2024-10-11 05:21:57,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:57,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:21:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:57,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:21:57,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:57,365 INFO L87 Difference]: Start difference. First operand 1412 states and 2097 transitions. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:57,606 INFO L93 Difference]: Finished difference Result 2611 states and 3875 transitions. [2024-10-11 05:21:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:57,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 493 [2024-10-11 05:21:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:57,612 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:21:57,612 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:57,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:21:57,616 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 3624 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3637 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:57,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3637 Valid, 3974 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:21:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.481746599856836) internal successors, (2070), 1397 states have internal predecessors, (2070), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2096 transitions. [2024-10-11 05:21:57,642 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2096 transitions. Word has length 493 [2024-10-11 05:21:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:57,643 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2096 transitions. [2024-10-11 05:21:57,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2096 transitions. [2024-10-11 05:21:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-10-11 05:21:57,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:57,647 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:57,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:21:57,647 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:57,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1941429522, now seen corresponding path program 1 times [2024-10-11 05:21:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:57,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076352202] [2024-10-11 05:21:57,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:21:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:21:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:21:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:21:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:21:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:21:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:21:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:21:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:21:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:21:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:21:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:21:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:21:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:21:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:21:59,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:21:59,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076352202] [2024-10-11 05:21:59,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076352202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:21:59,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:21:59,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:21:59,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820239828] [2024-10-11 05:21:59,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:21:59,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:21:59,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:21:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:21:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:21:59,066 INFO L87 Difference]: Start difference. First operand 1412 states and 2096 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:21:59,267 INFO L93 Difference]: Finished difference Result 2611 states and 3873 transitions. [2024-10-11 05:21:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:21:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 494 [2024-10-11 05:21:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:21:59,274 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:21:59,274 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:21:59,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:21:59,277 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 1771 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:21:59,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1771 Valid, 3974 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:21:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:21:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:21:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.4810307802433786) internal successors, (2069), 1397 states have internal predecessors, (2069), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:21:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2095 transitions. [2024-10-11 05:21:59,302 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2095 transitions. Word has length 494 [2024-10-11 05:21:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:21:59,303 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2095 transitions. [2024-10-11 05:21:59,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:21:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2095 transitions. [2024-10-11 05:21:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2024-10-11 05:21:59,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:21:59,307 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:21:59,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:21:59,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:21:59,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:21:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -840708561, now seen corresponding path program 1 times [2024-10-11 05:21:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:21:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466124311] [2024-10-11 05:21:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:21:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:21:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:22:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:22:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:22:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:22:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:22:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:22:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:22:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:22:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:22:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:22:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:22:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:22:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:22:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466124311] [2024-10-11 05:22:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466124311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:00,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:00,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:22:00,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279634035] [2024-10-11 05:22:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:00,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:22:00,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:22:00,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:22:00,597 INFO L87 Difference]: Start difference. First operand 1412 states and 2095 transitions. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:22:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:00,819 INFO L93 Difference]: Finished difference Result 2611 states and 3871 transitions. [2024-10-11 05:22:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:22:00,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 495 [2024-10-11 05:22:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:00,825 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:22:00,825 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:22:00,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:22:00,828 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 1728 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:00,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 3974 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:22:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:22:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:22:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.4803149606299213) internal successors, (2068), 1397 states have internal predecessors, (2068), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:22:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2094 transitions. [2024-10-11 05:22:00,853 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2094 transitions. Word has length 495 [2024-10-11 05:22:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:00,854 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2094 transitions. [2024-10-11 05:22:00,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:22:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2094 transitions. [2024-10-11 05:22:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2024-10-11 05:22:00,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:00,858 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:00,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:22:00,859 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:00,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1248029987, now seen corresponding path program 1 times [2024-10-11 05:22:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:00,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080286026] [2024-10-11 05:22:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:22:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:22:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:22:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:22:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:22:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:22:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:22:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:22:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:22:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:22:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:22:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:22:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:22:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:02,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:02,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080286026] [2024-10-11 05:22:02,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080286026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:02,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:02,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:22:02,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646592102] [2024-10-11 05:22:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:02,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:22:02,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:02,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:22:02,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:22:02,177 INFO L87 Difference]: Start difference. First operand 1412 states and 2094 transitions. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:22:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:02,390 INFO L93 Difference]: Finished difference Result 2611 states and 3869 transitions. [2024-10-11 05:22:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:22:02,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 496 [2024-10-11 05:22:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:02,395 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 05:22:02,395 INFO L226 Difference]: Without dead ends: 1412 [2024-10-11 05:22:02,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:22:02,397 INFO L432 NwaCegarLoop]: 1986 mSDtfsCounter, 1685 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:02,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 3974 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:22:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-11 05:22:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-10-11 05:22:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1397 states have (on average 1.479599141016464) internal successors, (2067), 1397 states have internal predecessors, (2067), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:22:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2093 transitions. [2024-10-11 05:22:02,421 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2093 transitions. Word has length 496 [2024-10-11 05:22:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:02,422 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2093 transitions. [2024-10-11 05:22:02,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 05:22:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2093 transitions. [2024-10-11 05:22:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2024-10-11 05:22:02,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:02,426 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:02,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:22:02,426 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:02,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash 668715294, now seen corresponding path program 1 times [2024-10-11 05:22:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:02,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432998614] [2024-10-11 05:22:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:22:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:22:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:22:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:22:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:22:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:22:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:22:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:22:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:22:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:22:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:22:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:22:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:22:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432998614] [2024-10-11 05:22:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432998614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:04,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:04,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:22:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724571282] [2024-10-11 05:22:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:04,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:22:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:04,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:22:04,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:22:04,778 INFO L87 Difference]: Start difference. First operand 1412 states and 2093 transitions. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:05,752 INFO L93 Difference]: Finished difference Result 2615 states and 3873 transitions. [2024-10-11 05:22:05,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:22:05,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 497 [2024-10-11 05:22:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:05,758 INFO L225 Difference]: With dead ends: 2615 [2024-10-11 05:22:05,758 INFO L226 Difference]: Without dead ends: 1416 [2024-10-11 05:22:05,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:22:05,761 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 1897 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1902 SdHoareTripleChecker+Valid, 4593 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:05,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1902 Valid, 4593 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:22:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-10-11 05:22:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1414. [2024-10-11 05:22:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1399 states have (on average 1.4789135096497499) internal successors, (2069), 1399 states have internal predecessors, (2069), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 05:22:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2095 transitions. [2024-10-11 05:22:05,789 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2095 transitions. Word has length 497 [2024-10-11 05:22:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:05,790 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2095 transitions. [2024-10-11 05:22:05,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2095 transitions. [2024-10-11 05:22:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-10-11 05:22:05,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:05,795 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:05,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:22:05,796 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash 727578837, now seen corresponding path program 1 times [2024-10-11 05:22:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678767622] [2024-10-11 05:22:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:22:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:22:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:22:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:22:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:22:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 05:22:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 05:22:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 05:22:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:22:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:22:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:22:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 05:22:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-11 05:22:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:09,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678767622] [2024-10-11 05:22:09,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678767622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:09,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:09,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:22:09,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080343475] [2024-10-11 05:22:09,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:09,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:22:09,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:22:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:22:09,265 INFO L87 Difference]: Start difference. First operand 1414 states and 2095 transitions. Second operand has 8 states, 8 states have (on average 54.5) internal successors, (436), 8 states have internal predecessors, (436), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 05:22:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:09,583 INFO L93 Difference]: Finished difference Result 4744 states and 7020 transitions. [2024-10-11 05:22:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:22:09,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 54.5) internal successors, (436), 8 states have internal predecessors, (436), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 498 [2024-10-11 05:22:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:09,593 INFO L225 Difference]: With dead ends: 4744 [2024-10-11 05:22:09,593 INFO L226 Difference]: Without dead ends: 3543 [2024-10-11 05:22:09,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:22:09,597 INFO L432 NwaCegarLoop]: 3381 mSDtfsCounter, 6609 mSDsluCounter, 14180 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6633 SdHoareTripleChecker+Valid, 17561 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:09,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6633 Valid, 17561 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:22:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2024-10-11 05:22:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 1660. [2024-10-11 05:22:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1635 states have (on average 1.4770642201834863) internal successors, (2415), 1635 states have internal predecessors, (2415), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:22:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2461 transitions. [2024-10-11 05:22:09,648 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2461 transitions. Word has length 498 [2024-10-11 05:22:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:09,648 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2461 transitions. [2024-10-11 05:22:09,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 54.5) internal successors, (436), 8 states have internal predecessors, (436), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 05:22:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2461 transitions. [2024-10-11 05:22:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2024-10-11 05:22:09,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:09,653 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:09,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:22:09,653 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:09,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1203614714, now seen corresponding path program 1 times [2024-10-11 05:22:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:09,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812656092] [2024-10-11 05:22:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 05:22:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:22:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:22:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 05:22:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 05:22:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 05:22:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-11 05:22:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 05:22:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-11 05:22:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 05:22:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-11 05:22:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 05:22:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-10-11 05:22:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:10,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:10,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812656092] [2024-10-11 05:22:10,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812656092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:10,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:10,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:22:10,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461419180] [2024-10-11 05:22:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:10,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:22:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:22:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:22:10,384 INFO L87 Difference]: Start difference. First operand 1660 states and 2461 transitions. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:10,451 INFO L93 Difference]: Finished difference Result 2865 states and 4243 transitions. [2024-10-11 05:22:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:22:10,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 499 [2024-10-11 05:22:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:10,456 INFO L225 Difference]: With dead ends: 2865 [2024-10-11 05:22:10,456 INFO L226 Difference]: Without dead ends: 1664 [2024-10-11 05:22:10,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:22:10,459 INFO L432 NwaCegarLoop]: 2086 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6237 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:10,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6237 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:22:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-10-11 05:22:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2024-10-11 05:22:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1639 states have (on average 1.4758999389871874) internal successors, (2419), 1639 states have internal predecessors, (2419), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:22:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2465 transitions. [2024-10-11 05:22:10,505 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2465 transitions. Word has length 499 [2024-10-11 05:22:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:10,505 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2465 transitions. [2024-10-11 05:22:10,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2465 transitions. [2024-10-11 05:22:10,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2024-10-11 05:22:10,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:10,510 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:10,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:22:10,510 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:10,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:10,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2110175150, now seen corresponding path program 1 times [2024-10-11 05:22:10,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:10,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353161881] [2024-10-11 05:22:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:22:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 05:22:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 05:22:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 05:22:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 05:22:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 05:22:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-11 05:22:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 05:22:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-11 05:22:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 05:22:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-11 05:22:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 05:22:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-10-11 05:22:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:12,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:12,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353161881] [2024-10-11 05:22:12,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353161881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:12,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:12,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:22:12,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064496220] [2024-10-11 05:22:12,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:12,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:22:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:12,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:22:12,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:22:12,116 INFO L87 Difference]: Start difference. First operand 1664 states and 2465 transitions. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:13,021 INFO L93 Difference]: Finished difference Result 2871 states and 4249 transitions. [2024-10-11 05:22:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:22:13,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 499 [2024-10-11 05:22:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:13,025 INFO L225 Difference]: With dead ends: 2871 [2024-10-11 05:22:13,025 INFO L226 Difference]: Without dead ends: 1668 [2024-10-11 05:22:13,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:22:13,027 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 1854 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 4593 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:13,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1859 Valid, 4593 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:22:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2024-10-11 05:22:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1666. [2024-10-11 05:22:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1641 states have (on average 1.4753199268738575) internal successors, (2421), 1641 states have internal predecessors, (2421), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:22:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2467 transitions. [2024-10-11 05:22:13,057 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2467 transitions. Word has length 499 [2024-10-11 05:22:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:13,058 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2467 transitions. [2024-10-11 05:22:13,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2467 transitions. [2024-10-11 05:22:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2024-10-11 05:22:13,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:13,062 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:13,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:22:13,062 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:13,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash -562437770, now seen corresponding path program 1 times [2024-10-11 05:22:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221505171] [2024-10-11 05:22:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:22:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 05:22:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 05:22:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 05:22:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 05:22:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 05:22:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-11 05:22:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 05:22:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-11 05:22:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 05:22:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-11 05:22:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 05:22:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-10-11 05:22:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:14,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:14,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221505171] [2024-10-11 05:22:14,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221505171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:14,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:14,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:22:14,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048959042] [2024-10-11 05:22:14,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:14,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:22:14,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:14,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:22:14,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:22:14,807 INFO L87 Difference]: Start difference. First operand 1666 states and 2467 transitions. Second operand has 7 states, 7 states have (on average 62.57142857142857) internal successors, (438), 7 states have internal predecessors, (438), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 05:22:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:15,450 INFO L93 Difference]: Finished difference Result 3056 states and 4519 transitions. [2024-10-11 05:22:15,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:22:15,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 62.57142857142857) internal successors, (438), 7 states have internal predecessors, (438), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 500 [2024-10-11 05:22:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:15,454 INFO L225 Difference]: With dead ends: 3056 [2024-10-11 05:22:15,454 INFO L226 Difference]: Without dead ends: 1674 [2024-10-11 05:22:15,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 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-11 05:22:15,457 INFO L432 NwaCegarLoop]: 2076 mSDtfsCounter, 1939 mSDsluCounter, 7761 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 9837 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:15,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 9837 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:22:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2024-10-11 05:22:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1670. [2024-10-11 05:22:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1645 states have (on average 1.4729483282674771) internal successors, (2423), 1645 states have internal predecessors, (2423), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:22:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2469 transitions. [2024-10-11 05:22:15,491 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2469 transitions. Word has length 500 [2024-10-11 05:22:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:15,492 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2469 transitions. [2024-10-11 05:22:15,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 62.57142857142857) internal successors, (438), 7 states have internal predecessors, (438), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 05:22:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2469 transitions. [2024-10-11 05:22:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2024-10-11 05:22:15,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:15,496 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:15,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:22:15,497 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:15,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:15,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1795448604, now seen corresponding path program 1 times [2024-10-11 05:22:15,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:15,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600334666] [2024-10-11 05:22:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:22:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 05:22:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 05:22:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 05:22:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 05:22:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 05:22:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 05:22:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-11 05:22:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-11 05:22:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 05:22:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 05:22:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-10-11 05:22:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-10-11 05:22:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:17,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:17,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600334666] [2024-10-11 05:22:17,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600334666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:17,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:17,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:22:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176498911] [2024-10-11 05:22:17,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:17,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:22:17,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:22:17,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:22:17,679 INFO L87 Difference]: Start difference. First operand 1670 states and 2469 transitions. Second operand has 7 states, 7 states have (on average 62.714285714285715) internal successors, (439), 7 states have internal predecessors, (439), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:17,910 INFO L93 Difference]: Finished difference Result 2952 states and 4361 transitions. [2024-10-11 05:22:17,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:22:17,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 62.714285714285715) internal successors, (439), 7 states have internal predecessors, (439), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 501 [2024-10-11 05:22:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:17,915 INFO L225 Difference]: With dead ends: 2952 [2024-10-11 05:22:17,915 INFO L226 Difference]: Without dead ends: 1686 [2024-10-11 05:22:17,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:22:17,918 INFO L432 NwaCegarLoop]: 2053 mSDtfsCounter, 1889 mSDsluCounter, 8181 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 10234 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:17,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 10234 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:22:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-10-11 05:22:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1680. [2024-10-11 05:22:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1655 states have (on average 1.4712990936555892) internal successors, (2435), 1655 states have internal predecessors, (2435), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:22:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2481 transitions. [2024-10-11 05:22:17,957 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2481 transitions. Word has length 501 [2024-10-11 05:22:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:17,957 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2481 transitions. [2024-10-11 05:22:17,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 62.714285714285715) internal successors, (439), 7 states have internal predecessors, (439), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2481 transitions. [2024-10-11 05:22:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-10-11 05:22:17,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:17,962 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:17,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:22:17,962 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:17,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2030187794, now seen corresponding path program 1 times [2024-10-11 05:22:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:17,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750905355] [2024-10-11 05:22:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:22:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 05:22:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 05:22:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 05:22:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 05:22:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 05:22:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 05:22:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-11 05:22:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-11 05:22:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 05:22:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-11 05:22:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-11 05:22:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-10-11 05:22:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:18,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:18,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750905355] [2024-10-11 05:22:18,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750905355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:18,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:18,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:22:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774877694] [2024-10-11 05:22:18,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:18,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:22:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:18,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:22:18,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:22:18,771 INFO L87 Difference]: Start difference. First operand 1680 states and 2481 transitions. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 05:22:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:20,026 INFO L93 Difference]: Finished difference Result 2951 states and 4355 transitions. [2024-10-11 05:22:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:22:20,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 502 [2024-10-11 05:22:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:20,031 INFO L225 Difference]: With dead ends: 2951 [2024-10-11 05:22:20,031 INFO L226 Difference]: Without dead ends: 1688 [2024-10-11 05:22:20,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:22:20,034 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 2023 mSDsluCounter, 4602 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2033 SdHoareTripleChecker+Valid, 6146 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:20,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2033 Valid, 6146 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:22:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2024-10-11 05:22:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1684. [2024-10-11 05:22:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1659 states have (on average 1.4701627486437614) internal successors, (2439), 1659 states have internal predecessors, (2439), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:22:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2485 transitions. [2024-10-11 05:22:20,067 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2485 transitions. Word has length 502 [2024-10-11 05:22:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:20,067 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2485 transitions. [2024-10-11 05:22:20,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 05:22:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2485 transitions. [2024-10-11 05:22:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-10-11 05:22:20,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:20,072 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:20,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:22:20,072 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:20,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:20,073 INFO L85 PathProgramCache]: Analyzing trace with hash 308293216, now seen corresponding path program 1 times [2024-10-11 05:22:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054512205] [2024-10-11 05:22:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:22:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 05:22:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 05:22:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 05:22:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 05:22:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 05:22:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 05:22:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-11 05:22:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-11 05:22:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 05:22:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-11 05:22:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-11 05:22:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-10-11 05:22:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:20,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:20,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054512205] [2024-10-11 05:22:20,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054512205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:20,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:20,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:22:20,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547130524] [2024-10-11 05:22:20,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:20,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:22:20,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:20,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:22:20,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:22:20,794 INFO L87 Difference]: Start difference. First operand 1684 states and 2485 transitions. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:20,859 INFO L93 Difference]: Finished difference Result 2969 states and 4378 transitions. [2024-10-11 05:22:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:22:20,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 502 [2024-10-11 05:22:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:20,863 INFO L225 Difference]: With dead ends: 2969 [2024-10-11 05:22:20,863 INFO L226 Difference]: Without dead ends: 1688 [2024-10-11 05:22:20,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:22:20,866 INFO L432 NwaCegarLoop]: 2085 mSDtfsCounter, 0 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6234 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:20,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6234 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:22:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2024-10-11 05:22:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1688. [2024-10-11 05:22:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1688 states, 1663 states have (on average 1.4690318701142513) internal successors, (2443), 1663 states have internal predecessors, (2443), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 05:22:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2489 transitions. [2024-10-11 05:22:20,897 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2489 transitions. Word has length 502 [2024-10-11 05:22:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:20,898 INFO L471 AbstractCegarLoop]: Abstraction has 1688 states and 2489 transitions. [2024-10-11 05:22:20,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 05:22:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2489 transitions. [2024-10-11 05:22:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-10-11 05:22:20,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:20,903 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:20,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:22:20,904 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:20,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2092044637, now seen corresponding path program 1 times [2024-10-11 05:22:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:20,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025621816] [2024-10-11 05:22:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:20,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:22:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 05:22:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 05:22:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 05:22:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 05:22:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 05:22:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-11 05:22:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-11 05:22:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-11 05:22:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 05:22:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-11 05:22:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-10-11 05:22:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-10-11 05:22:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:22:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 05:22:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:22:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025621816] [2024-10-11 05:22:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025621816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:22:22,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:22:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:22:22,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876256187] [2024-10-11 05:22:22,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:22:22,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:22:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:22:22,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:22:22,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:22:22,122 INFO L87 Difference]: Start difference. First operand 1688 states and 2489 transitions. Second operand has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 05:22:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:22:22,998 INFO L93 Difference]: Finished difference Result 4674 states and 6881 transitions. [2024-10-11 05:22:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:22:22,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 503 [2024-10-11 05:22:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:22:23,006 INFO L225 Difference]: With dead ends: 4674 [2024-10-11 05:22:23,006 INFO L226 Difference]: Without dead ends: 3330 [2024-10-11 05:22:23,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:22:23,010 INFO L432 NwaCegarLoop]: 1713 mSDtfsCounter, 3338 mSDsluCounter, 5544 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3352 SdHoareTripleChecker+Valid, 7257 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:22:23,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3352 Valid, 7257 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:22:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2024-10-11 05:22:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2076. [2024-10-11 05:22:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 2037 states have (on average 1.4663721158566518) internal successors, (2987), 2037 states have internal predecessors, (2987), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 05:22:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 3061 transitions. [2024-10-11 05:22:23,057 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 3061 transitions. Word has length 503 [2024-10-11 05:22:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:22:23,058 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 3061 transitions. [2024-10-11 05:22:23,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 05:22:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 3061 transitions. [2024-10-11 05:22:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-10-11 05:22:23,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:22:23,063 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:22:23,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:22:23,064 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:22:23,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:22:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1638760008, now seen corresponding path program 1 times [2024-10-11 05:22:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:22:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509834484] [2024-10-11 05:22:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:22:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:22:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat